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