Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (2001) (Lecture Notes in Computer Science #2241)

By: Michael Jünger and Denis Naddef

Sign Up Now! Already a Member? Log In
You must be logged into UK education collection to access this title. Learn about membership options, or view our freely available titles.

Synopsis: 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.

Book Quality:: Publisher Quality
ISBN-13:: 9783540455868
Related ISBNs:: 9783540428770
Publisher:: Springer Berlin Heidelberg
Date of Addition:: 07/10/22
Copyrighted By:: N/A
Adult content:: No
Language:: English
Has Image Descriptions:: No
Categories:: Nonfiction, Computers and Internet, Business and Finance, Mathematics and Statistics
Submitted By:: Bookshare Staff
Usage Restrictions:: This is a copyrighted book.
Edited by:: Michael Jünger
Edited by:: Denis Naddef