Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008916674/catalog> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- catalog abstract "Publisher description: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.".
- catalog contributor b12520591.
- catalog contributor b12520592.
- catalog created "c2001.".
- catalog date "2001".
- catalog date "c2001.".
- catalog dateCopyrighted "c2001.".
- catalog description "General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf [and others] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.".
- catalog description "Includes bibliographical references and index.".
- catalog description "Publisher description: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.".
- catalog extent "viii, 303 p. :".
- catalog identifier "3540428771 (pbk. : alk. paper)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2241.".
- catalog issued "2001".
- catalog issued "c2001.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "519.7 21".
- catalog subject "Combinatorial optimization Congresses.".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Data structures (Computer science).".
- catalog subject "Electronic data processing.".
- catalog subject "Management information systems.".
- catalog subject "Programming (Mathematics) Congresses.".
- catalog subject "T57.7 .C66 2001".
- catalog tableOfContents "General mixed integer programming : computational issues for branch-and-cut algorithms / Alexander Martin -- Projection and lifting in combinatorial optimization / Egon Balas -- Mathematical programming models and formulations for deterministic production planning problems / Yves Pochet -- Lagrangian relaxation / Claude Lemaréchal -- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS / Matthias Elf [and others] -- Branch, cut, and price : sequential and parallel / Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter, Jr. -- TSP cuts which do not conform to the template paradigm / David Applegate, Robert Bixby, Vašek Chvátal.".
- catalog title "Computational combinatorial optimization : optimal or provably near-optimal solutions / Michael Jünger, Denis Naddef (eds.).".
- catalog type "Conference proceedings. fast".
- catalog type "Dagstuhl (2000) swd".
- catalog type "text".