


default search action
Computational Combinatorial Optimization 2001: Dagstuhl, Germany
- Michael Jünger, Denis Naddef:

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 - Alexander Martin

:
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. 1-25 - Egon Balas:

Projection and Lifting in Combinatorial Optimization. 26-56 - Yves Pochet:

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems. 57-111 - Claude Lemaréchal:

Lagrangian Relaxation. 112-156 - Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi:

Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. 157-222 - Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr.:

Branch, Cut, and Price: Sequential and Parallel. 223-260 - David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:

TSP Cuts Which Do Not Conform to the Template Paradigm. 261-304

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














