Volume 32, Number 1, January 2004
: The MA-ordering max-flow algorithm is not strongly polynomial for directed networks.
: A note on maximizing a submodular set function subject to a knapsack constraint.
Dorit S. Hochbaum
: Monotonizing linear programs with up to two nonzeroes per column.
, Xiaoling Hou
: A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP.
Volume 32, Number 2, March 2004
: The expected length of a random line segment in a rectangle.
Jean B. Lasserre
: Integer programming, Barvinok's counting algorithm and Gomory relaxations.
: Randomized on-line scheduling on three processors.
: Minmax regret linear resource allocation problems.
, Sven de Vries
: Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
, Zeger Degraeve
: Improved lower bounds for the capacitated lot sizing problem with setup times.
Jeffrey P. Kharoufeh
: Erratum to "Explicit results for wear processes in a Markovian environment" [Oper. Res. Lett. 31(3) (2003) 237-244].
Paul A. Rubin
: Comment on "A nonlinear Lagrangian dual for integer programming".
Volume 32, Number 3, May 2004
: Sorting weighted distances with applications to objective function evaluations in single facility location problems.
: Asymptotics of overflow probabilities in Jackson networks.
: Basic optimality results for Bayesian group replacement policies.
Volume 32, Number 4, July 2004
: A better approximation algorithm for the budget prize collecting tree problem.
: On the complexity of the car sequencing problem.
: On the modulus algorithm for the linear complementarity problem.
Y. W. Yang Woo Shin
: BMAP/G/1 queue with correlated arrivals of customers and disasters.
: Periodic review inventory control with fluctuating purchasing costs.
: An extension of the Euler Laplace transform inversion algorithm with applications in option pricing.
Volume 32, Number 5, September 2004
: Analysis of an M/G/ queue with batch arrivals and batch-dedicated servers.
Attahiru Sule Alfa
: Loss probability in an overloaded discrete-time GI/G/1/K system with very large K.
: Conic systems and sublinear mappings: equivalent approaches.
Volume 32, Number 6, November 2004
: Strongly polynomial-time approximation for a class of bicriteria problems.
Rob van Stee
: An approximation algorithm for square packing.
Jesper Makholm Byskov
: Enumerating maximal independent sets with applications to graph colouring.
Alix Munier Kordon
: Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
Bong Dae Choi
, Bara Kim
: Non-ergodicity criteria for denumerable continuous time Markov processes.
: Inventory replenishment model: lot sizing versus just-in-time delivery.