Volume 39, Number 1, January 2011
, Ananth Iyer
: Consolidating or non-consolidating queues: A game theoretic queueing model with holding costs.
: Determining Type II sensitivity ranges of the fractional assignment problem.
, Yongpei Guan
: An O(N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times.
: Existence of optimal solutions for general stochastic linear complementarity problems.
Volume 39, Number 2, March 2011
: A dynamic programming approach to adjustable robust optimization.
, Donghui Li
: A projected semismooth Newton method for problems of calibrating least squares covariance matrix.
, Homarjun Agrahari
: A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations.
Michael R. Wagner
: Online lot-sizing problems with ordering, holding and shortage costs.
Volume 39, Number 3, May 2011
: On the facets of the stable set polytope of quasi-line graphs.
, Jeongsim Kim
: Higher moments of the waiting time distribution in M/G/1 retrial queues.
Volume 39, Number 4, July 2011
James W. Boudreau
: A note on the efficiency and fairness of decentralized matching.
: An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule.
: Option pricing under joint dynamics of interest rates, dividends, and stock prices.
: Consumption/investment problem when the investment opportunity set can be enlarged by information gathering.
Volume 39, Number 5, September 2011
, Yinghong Xu
: A full-Newton step interior-point algorithm based on modified Newton direction.
: Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty.
: An efficient randomized group testing procedure to determine the number of defectives.
Moritz A. Drexl
: An approximation algorithm for the k-Level Concentrator Location Problem.
, Xianping Guo
: Markov decision processes with state-dependent discount factors and unbounded rewards/costs.
: Optimal dynamic pricing and inventory control with stock deterioration and partial backordering.
Volume 39, Number 6, November 2011
Anke van Zuylen
: An improved monotone algorithm for scheduling related machines with precedence constraints.