Computational Combinatorial Optimization 2001: Dagstuhl, Germany

Michael Jünger, Denis Naddef (Eds.): Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]. Lecture Notes in Computer Science 2241 Springer 2001, ISBN 3-540-42877-1 BibTeX

@proceedings{DBLP:conf/cco/2001,
  editor    = {Michael J{\"u}nger and
               Denis Naddef},
  title     = {Computational Combinatorial Optimization, Optimal or Provably
               Near-Optimal Solutions [based on a Spring School, Schlo{\ss}
               Dagstuhl, Germany, 15-19 May 2000]},
  booktitle = {Computational Combinatorial Optimization},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2241},
  year      = {2001},
  isbn      = {3-540-42877-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Alexander Martin:
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. 1-25
Electronic Edition (Springer LINK) BibTeX
Egon Balas:
Projection and Lifting in Combinatorial Optimization. 26-56
Electronic Edition (Springer LINK) BibTeX
Yves Pochet:
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems. 57-111
Electronic Edition (Springer LINK) BibTeX
Claude Lemaréchal:
Lagrangian Relaxation. 112-156
Electronic Edition (Springer LINK) BibTeX
Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi:
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. 157-222
Electronic Edition (Springer LINK) BibTeX
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:
Branch, Cut, and Price: Sequential and Parallel. 223-260
Electronic Edition (Springer LINK) BibTeX
David Applegate, Robert E. Bixby, Vasek Chvátal, William Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm. 261-304
Electronic Edition (Springer LINK) BibTeX