Discrete Optimization, Volume 1

Volume 1, Number 1, June 2004

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

Volume 1, Number 2, November 2004

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