Discrete Optimization, Volume 4

Volume 4, Number 1, March 2007

• Jon Lee, Adam N. Letchford:
  Mixed integer programming. 1-2
  
• Tobias Achterberg:
  Conflict analysis in mixed integer programming. 4-20
  
• Yongpei Guan, Shabbir Ahmed, George L. Nemhauser:
  Sequential pairing of mixed integer inequalities. 21-39
  
• François Margot:
  Symmetric ILP: Coloring and small integers. 40-62
  
• Livio Bertacco, Matteo Fischetti, Andrea Lodi:
  A feasibility pump heuristic for general mixed-integer problems. 63-76
  
• Tobias Achterberg, Timo Berthold:
  Improving the feasibility pump. 77-86
  
• Xiaoyun Ji, John E. Mitchell:
  Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. 87-102
  
• Pasquale Avella, Sara Mattia, Antonio Sassano:
  Metric inequalities and the Network Loading Problem. 103-114
  
• Daniel Bienstock, Sara Mattia:
  Using mixed-integer programming to solve power grid blackout problems. 115-141
  

Volume 4, Number 2, June 2007

• Nikhil Bansal, Maxim Sviridenko:
  Two-dimensional bin packing with one-dimensional resource augmentation. 143-153
  
• Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger:
  A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. 154-162
  
• Peter Butkovic, Seth Lewis:
  On the job rotation problem. 163-174
  
• T. C. Edwin Cheng, Natalia V. Shakhlevich:
  Two-machine open shop problem with controllable processing times. 175-184
  
• Leah Epstein, Rob van Stee:
  Bounds for online bounded space hypercube packing. 185-197
  
• Takuro Fukunaga, Hiroshi Nagamochi:
  Generalizing the induced matching by edge capacity constraints. 198-205
  
• Laura A. McLay, Sheldon H. Jacobson:
  Algorithms for the bounded set-up knapsack problem. 206-212
  
• Gerhard J. Woeginger, Jiri Sgall:
  On the complexity of cake cutting. 213-220
  
• Michael M. Sørensen:
  Facet-defining inequalities for the simple graph partitioning polytope. 221-231
  
• Wilbert E. Wilhelm, Nilanjan D. Choudhury, Purushothaman Damodaran:
  A model to optimize placement operations on dual-head placement machines. 232-256
  

Volume 4, Numbers 3-4, December 2007

• Endre Boros, Yves Crama, Bruno Simeone:
  Peter Ladislaw Hammer: December 23, 1936-December 27, 2006. 257-259
  
• Alexander D. Scott, Gregory B. Sorkin:
  Linear-programming design and analysis of fast algorithms for Max 2-CSP. 260-287
  
• Luc Mercier, Pascal Van Hentenryck:
  Strong polynomiality of resource constraint propagation. 288-314
  
• Gerard van der Laan, Dolf Talman, Zaifu Yang:
  Computing integral solutions of complementarity problems. 315-321
  
• Leah Epstein, Rob van Stee:
  Online bin packing with resource augmentation. 322-333
  
• Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz:
  Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. 334-348
  
• Kiyohito Nagano:
  A strongly polynomial algorithm for line search in submodular polyhedra. 349-359
  
• Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd:
  Biclique completion problems for multicast network design. 360-377
  
• Bruno Escoffier, Peter L. Hammer:
  Approximation of the Quadratic Set Covering problem. 378-386