Journal: Discrete Optimization

Volume 2, Issue 4

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

Volume 2, Issue 3

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

Volume 2, Issue 2

113 -- 122Miguel F. Anjos, Andrew A. Kennings, Anthony Vannelli. A semidefinite optimization approach for the single-row layout problem with unequal dimensions
123 -- 134Shelby Brumelle, Daniel Granot, Li Liu. Ordered optimal solutions and parametric minimum cut problems
135 -- 144Jesú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
145 -- 153Marc Demange, Tinaz Ekim, Dominique de Werra. Partitioning cographs into cliques and stable sets
154 -- 167David Pisinger, Mikkel Sigurd. The two-dimensional bin packing problem with variable bin sizes and costs
168 -- 184Arie Tamir, Nir Halman. One-way and round-trip center location problems
185 -- 188Olivier Cogis, Eric Thierry. Computing maximum stable sets for distance-hereditary graphs

Volume 2, Issue 1

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