Journal: Discrete Optimization

Volume 4, Issue 3-4

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

Volume 4, Issue 2

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

Volume 4, Issue 1

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