Coverart for item
The Resource Computational combinatorial optimization : optimal or provably near-optimal solutions, Michael Ju{u00A8}nger, Denis Naddef (eds.)

Computational combinatorial optimization : optimal or provably near-optimal solutions, Michael Ju{u00A8}nger, Denis Naddef (eds.)

Label
Computational combinatorial optimization : optimal or provably near-optimal solutions
Title
Computational combinatorial optimization
Title remainder
optimal or provably near-optimal solutions
Statement of responsibility
Michael Ju{u00A8}nger, Denis Naddef (eds.)
Contributor
Subject
Genre
Language
eng
Summary
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
Member of
Additional physical form
Also available via the World Wide Web. Abstracts available without subscription.
Cataloging source
DLC
Dewey number
519.7
Illustrations
illustrations
Index
index present
LC call number
T57.7
LC item number
.C66 2001
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1947-
http://library.link/vocab/relatedWorkOrContributorName
  • Jünger, M.
  • Naddef, Denis
Series statement
Lecture notes in computer science,
Series volume
2241
http://library.link/vocab/subjectName
  • Programming (Mathematics)
  • Combinatorial optimization
Label
Computational combinatorial optimization : optimal or provably near-optimal solutions, Michael Ju{u00A8}nger, Denis Naddef (eds.)
Instantiates
Publication
Note
"Tutorial"--Cover
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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 ... [et al.] -- 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
Control code
48449671
Dimensions
24 cm
Dimensions
unknown
Extent
viii, 303 pages
Isbn
9783540428770
Isbn Type
(softcover : alk. paper)
Lccn
2001057557
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Specific material designation
remote
Label
Computational combinatorial optimization : optimal or provably near-optimal solutions, Michael Ju{u00A8}nger, Denis Naddef (eds.)
Publication
Note
"Tutorial"--Cover
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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 ... [et al.] -- 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
Control code
48449671
Dimensions
24 cm
Dimensions
unknown
Extent
viii, 303 pages
Isbn
9783540428770
Isbn Type
(softcover : alk. paper)
Lccn
2001057557
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Specific material designation
remote

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107
Processing Feedback ...