Volume 124, Numbers 1-2, July 2010
Series B - Special Issue:
Combinatorial Optimization and Integer Programming
- Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization.
1-6
- Jean François Maurras:
Note on separation from membership, and folklore.
7-11
- Immanuel M. Bomze, Florian Frommlet, Marco Locatelli:
Copositivity cuts for improving SDP bounds on the clique number.
13-32
- Kurt M. Anstreicher, Samuel Burer:
Computable representations for convex hulls of low-dimensional quadratic forms.
33-43
- Tristram Bogart, Annie Raymond, Rekha R. Thomas:
Small Chvátal Rank.
45-68
- Konstantinos Kaparis, Adam N. Letchford:
Separation algorithms for 0-1 knapsack polytopes.
69-91
- Alberto Caprara, Adam N. Letchford:
New techniques for cost sharing in combinatorial optimization games.
93-118
- Alain Prodon, Scott DeNegre, Thomas M. Liebling:
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems.
119-141
- Santanu S. Dey, Laurence A. Wolsey:
Two row mixed-integer cuts via lifting.
143-174
- Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette:
A note on the selection of Benders' cuts.
175-182
- Oktay Günlük, Jeff Linderoth:
Perspective reformulations of mixed integer nonlinear programs with indicator variables.
183-205
- Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a real-world train-unit assignment problem.
207-231
- Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel:
Parametric nonlinear discrete optimization over well-described sets and matroid intersections.
233-253
- José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi:
Approximating a class of combinatorial problems with rational objective function.
255-269
- Ali Ridha Mahjoub, S. Thomas McCormick:
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.
271-284
- Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses:
Efficient and fair routing for mesh networks.
285-316
- Maren Martens, S. Thomas McCormick, Maurice Queyranne:
Separation, dimension, and facet algorithms for node flow polyhedra.
317-348
- Antoine Musitelli:
Recognizing binet matrices.
349-381
- Anureet Saxena, Pierre Bonami, Jon Lee:
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations.
383-411
- Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.
413-439
- Martin Skutella, Alexia Weber:
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency.
441-454
- Kent Andersen, Quentin Louveaux, Robert Weismantel:
Mixed-integer sets from two rows of two adjacent simplex bases.
455-480
- Mohit Tawarmalani, Jean-Philippe P. Richard, Kwanghun Chung:
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets.
481-512
- Christoph Buchheim, Frauke Liers, Marcus Oswald:
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization.
513-535
Last update Thu May 23 19:17:00 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
