1. Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

   • Thomas M. Liebling
   • Denis Naddef
   • Laurence A. Wolsey

   OriginalPaper 10 November 2005 Pages: 157 - 160

2. Recognizing Balanceable Matrices

   • Michele Conforti
   • Giacomo Zambelli

   OriginalPaper 10 November 2005 Pages: 161 - 179

3. Network reinforcement

   • Francisco Barahona

   OriginalPaper 10 November 2005 Pages: 181 - 200

4. Independent packings in structured graphs

   • Kathie Cameron
   • Pavol Hell

   OriginalPaper 14 November 2005 Pages: 201 - 213

5. Polyhedra related to integer-convex polynomial systems

   • Dennis Michaels
   • Robert Weismantel

   OriginalPaper 12 October 2005 Pages: 215 - 232

6. On Balanced Graphs

   • Flavia Bonomo
   • Guillermo Durán
   • Jayme L Szwarcfiter

   OriginalPaper 10 November 2005 Pages: 233 - 250

7. Projection results for vehicle routing

   • Adam N. Letchford
   • Juan-José Salazar-González

   OriginalPaper 12 October 2005 Pages: 251 - 274

8. On the complexity of the planar directed edge-disjoint paths problem

   • Dirk Müller

   OriginalPaper 12 October 2005 Pages: 275 - 288

9. Critical extreme points of the 2-edge connected spanning subgraph polytope

   • Jean Fonlupt
   • A. Ridha Mahjoub

   OriginalPaper 10 November 2005 Pages: 289 - 310

10. Almost all webs are not rank-perfect

    • Arnaud Pêcher
    • Annegret K. Wagler

    OriginalPaper 12 October 2005 Pages: 311 - 328

11. A linear programming formulation for the maximum complete multipartite subgraph problem

    • Denis Cornaz

    OriginalPaper 10 November 2005 Pages: 329 - 344

12. Polyhedral description of the integer single node flow set with constant bounds

    • Agostinho Agra
    • Miguel F. Constantino

    OriginalPaper 12 October 2005 Pages: 345 - 364

13. Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse

    • Rüdiger Schultz
    • Stephan Tiedemann

    OriginalPaper 10 November 2005 Pages: 365 - 386

14. A branch-and-cut algorithm for multiple sequence alignment

    • Ernst Althaus
    • Alberto Caprara
    • Knut Reinert

    OriginalPaper 10 November 2005 Pages: 387 - 425

15. An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

    • Ivana Ljubić
    • René Weiskircher
    • Matteo Fischetti

    OriginalPaper 12 October 2005 Pages: 427 - 449

16. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

    • Ilse Fischer
    • Gerald Gruber
    • Renata Sotirov

    OriginalPaper 12 October 2005 Pages: 451 - 469

17. A new ILP-based refinement heuristic for Vehicle Routing Problems

    • Roberto De Franceschi
    • Matteo Fischetti
    • Paolo Toth

    OriginalPaper 14 November 2005 Pages: 471 - 499

18. Approximate extended formulations

    • Mathieu Van Vyve
    • Laurence A. Wolsey

    OriginalPaper 12 October 2005 Pages: 501 - 522

19. Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

    • S. Shebalov
    • D. Klabjan

    OriginalPaper 12 October 2005 Pages: 523 - 561

20. Mixed Integer Models for the Stationary Case of Gas Network Optimization

    • Alexander Martin
    • Markus Möller
    • Susanne Moritz

    OriginalPaper 10 November 2005 Pages: 563 - 582

21. Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

    • Juan-José Salazar-González

    OriginalPaper 12 October 2005 Pages: 583 - 603