Journal: Discrete Optimization

Volume 1, Issue 2

99 -- 120Warren P. Adams, Richard J. Forrester, Fred Glover. Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
121 -- 127Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo. When the greedy algorithm fails
129 -- 140Francisco Barahona, Hervé Kerivin. Separation of partition inequalities with terminals
141 -- 165Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey. Extended formulations for Gomory Corner polyhedra
167 -- 187Jean B. Lasserre. Generating functions and duality for integer programs
189 -- 203Mathieu Van Vyve, F. Ortega. Lot-sizing with fixed charges on stocks: the convex hull
205 -- 214Walter Kern, Daniël Paulusma. The computational complexity of the elimination problem in generalized sports competitions
215 -- 228Nikolaus Ruf, Anita Schöbel. Set covering with almost consecutive ones property
229 -- 231Martin Kochol. A note on approximation of a ball by polytopes

Volume 1, Issue 1

3 -- 12Egon Balas, Stefan Schmieta, Christopher Wallace. Pivot and shift - a mixed integer programming heuristic
13 -- 21Daniel Bienstock, Nuri Özbay. Tree-width and the Sherali-Adams operator
23 -- 39Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang. Inverse median problems
41 -- 49Satoru Fujishige. Dual greedy polyhedra, choice functions, and abstract convex geometries
51 -- 66Alexander V. Karzanov. One more well-solved case of the multifacility location problem
67 -- 75Jean B. Lasserre. A discrete Farkas lemma
77 -- 85Jon Lee, Janny Leung, François Margot. Min-up/min-down polytopes
87 -- 98Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover. A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem