Discrete Optimization, Volume 2

Volume 2, Number 1, March 2005

• Jean B. Lasserre:
  Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]. 1
  
• Igor Averbakh, Sergey Bereg:
  Facility location problems with uncertainty on the plane. 3-34
  
• Francisco Barahona, Fabián A. Chudak:
  Near-optimal solutions to large-scale facility location problems. 35-50
  
• Fred Glover, Hanif D. Sherali:
  Chvatal-Gomory-tier cuts for general integer programs. 51-69
  
• Gregory Gutin, Tommy R. Jensen, Anders Yeo:
  Batched bin packing. 71-82
  
• Philippe Baptiste, Claude Le Pape:
  Scheduling a single machine to minimize a regular objective function under setup constraints. 83-99
  
• Michael Okun:
  On approximation of the vertex cover problem in hypergraphs. 101-111
  

Volume 2, Number 2, June 2005

• Miguel F. Anjos, Andrew A. Kennings, Anthony Vannelli:
  A semidefinite optimization approach for the single-row layout problem with unequal dimensions. 113-122
  
• Shelby Brumelle, Daniel Granot, Li Liu:
  Ordered optimal solutions and parametric minimum cut problems. 123-134
  
• Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida:
  A computational study of integer programming algorithms based on Barvinok's rational functions. 135-144
  
• Marc Demange, Tinaz Ekim, Dominique de Werra:
  Partitioning cographs into cliques and stable sets. 145-153
  
• David Pisinger, Mikkel Sigurd:
  The two-dimensional bin packing problem with variable bin sizes and costs. 154-167
  
• Arie Tamir, Nir Halman:
  One-way and round-trip center location problems. 168-184
  
• Olivier Cogis, Eric Thierry:
  Computing maximum stable sets for distance-hereditary graphs. 185-188
  

Volume 2, Number 3, September 2005

• Don Coppersmith, Jon Lee:
  Parsimonious binary-encoding in integer programming. 190-200
  
• Mohamed Haouari, Anis Gharbi:
  Fast lifting procedures for the bin packing problem. 201-218
  
• Brady Hunsaker, Craig A. Tovey:
  Simple lifted cover inequalities and hard knapsack problems. 219-228
  
• Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair:
  Multiroute flows: Cut-trees and realizability. 229-240
  
• Arie M. C. A. Koster, Adrian Zymolka:
  On cycles and the stable multi-set polytope. 241-255
  
• Kazuo Murota, Akiyoshi Shioura:
  Substitutes and complements in network flows viewed as discrete convexity. 256-268
  
• Gerhard J. Woeginger:
  A comment on scheduling two parallel machines with capacity constraints. 269-272
  

Volume 2, Number 4, December 2005

• Igor Averbakh:
  Computing and minimizing the relative regret in combinatorial optimization with interval data. 273-287
  
• Pierre Bonami, Michel Minoux:
  Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. 288-307
  
• Christoph Buchheim, Michael Jünger:
  Linear optimization over permutation groups. 308-319
  
• David Hartvigsen:
  The S-digraph optimization problem and the greedy algorithm. 320-334
  
• Lata Narayanan, Jaroslav Opatrny:
  Wavelength routing of uniform instances in all-optical rings. 335-347
  
• Hanif D. Sherali, Jonathan Cole Smith:
  Interleaving two-phased jobs on a single machine. 348-361
  
• Jens Vygen:
  Geometric quadrisection in linear time, with application to VLSI placement. 362-390
  
• Yakov Zinder, Van Ha Do, Ceyda Oguz:
  Computational complexity of some scheduling problems with multiprocessor tasks. 391-408