1. Traces of the XII Aussois Workshop on Combinatorial Optimization

   • Michael Jünger
   • Thomas M. Liebling
   • Laurence A. Wolsey

   Preface 09 May 2010 Pages: 1 - 6

2. Note on separation from membership, and folklore

   • Jean François Maurras

   Full Length Paper 13 May 2010 Pages: 7 - 11

3. Copositivity cuts for improving SDP bounds on the clique number

   • Immanuel M. Bomze
   • Florian Frommlet
   • Marco Locatelli

   Full Length Paper 16 May 2010 Pages: 13 - 32

4. Computable representations for convex hulls of low-dimensional quadratic forms

   • Kurt M. Anstreicher
   • Samuel Burer

   Full Length Paper 11 May 2010 Pages: 33 - 43

5. Small Chvátal Rank

   • Tristram Bogart
   • Annie Raymond
   • Rekha Thomas

   Full Length Paper 14 May 2010 Pages: 45 - 68

6. Separation algorithms for 0-1 knapsack polytopes

   • Konstantinos Kaparis
   • Adam N. Letchford

   Full Length Paper 08 May 2010 Pages: 69 - 91

7. New techniques for cost sharing in combinatorial optimization games

   • Alberto Caprara
   • Adam N. Letchford

   Full Length Paper 11 May 2010 Pages: 93 - 118

8. Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems

   • Alain Prodon
   • Scott DeNegre
   • Thomas M. Liebling

   Full Length Paper 09 May 2010 Pages: 119 - 141

9. Two row mixed-integer cuts via lifting

   • Santanu S. Dey
   • Laurence A. Wolsey

   Full Length Paper 18 May 2010 Pages: 143 - 174

10. A note on the selection of Benders’ cuts

    • Matteo Fischetti
    • Domenico Salvagnin
    • Arrigo Zanette

    Full Length Paper 12 May 2010 Pages: 175 - 182

11. Perspective reformulations of mixed integer nonlinear programs with indicator variables

    • Oktay Günlük
    • Jeff Linderoth

    Full Length Paper 09 May 2010 Pages: 183 - 205

12. Solving a real-world train-unit assignment problem

    • Valentina Cacchiani
    • Alberto Caprara
    • Paolo Toth

    Full Length Paper 09 May 2010 Pages: 207 - 231

13. Parametric nonlinear discrete optimization over well-described sets and matroid intersections

    • Y. Berstein
    • J. Lee
    • R. Weismantel

    Full Length Paper 20 May 2010 Pages: 233 - 253

14. Approximating a class of combinatorial problems with rational objective function

    • José R. Correa
    • Cristina G. Fernandes
    • Yoshiko Wakabayashi

    Full Length Paper 08 May 2010 Pages: 255 - 269

15. Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

    • A. Ridha Mahjoub
    • S. Thomas McCormick

    Full Length Paper 11 May 2010 Pages: 271 - 284

16. Efficient and fair routing for mesh networks

    • Andrea Lodi
    • Enrico Malaguti
    • Nicolás E. Stier-Moses

    Full Length Paper 14 May 2010 Pages: 285 - 316

17. Separation, dimension, and facet algorithms for node flow polyhedra

    • Maren Martens
    • S. Thomas McCormick
    • Maurice Queyranne

    Full Length Paper 19 May 2010 Pages: 317 - 348

18. Recognizing binet matrices

    • Antoine Musitelli

    Full Length Paper 13 June 2010 Pages: 349 - 381

19. Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

    • Anureet Saxena
    • Pierre Bonami
    • Jon Lee

    Full Length Paper 12 May 2010 Pages: 383 - 411

20. Orientation-based models for {0,1,2}-survivable network design: theory and practice

    • Markus Chimani
    • Maria Kandyba
    • Petra Mutzel

    Full Length Paper 09 May 2010 Pages: 413 - 439

21. On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency

    • Martin Skutella
    • Alexia Weber

    Full Length Paper 09 May 2010 Pages: 441 - 454

22. Mixed-integer sets from two rows of two adjacent simplex bases

    • Kent Andersen
    • Quentin Louveaux
    • Robert Weismantel

    Full Length Paper 16 May 2010 Pages: 455 - 480

23. Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

    • Mohit Tawarmalani
    • Jean-Philippe P. Richard
    • Kwanghun Chung

    Full Length Paper 20 May 2010 Pages: 481 - 512

24. Speeding up IP-based algorithms for constrained quadratic 0–1 optimization

    • Christoph Buchheim
    • Frauke Liers
    • Marcus Oswald

    Full Length Paper 08 May 2010 Pages: 513 - 535