Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes
By addebook • Jun 28th, 2008 • Category: Mathematics
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
Publisher: Springer
Number Of Pages: 314
Publication Date: 2001-12-18
Sales Rank: 2375690
ISBN / ASIN: 3540428771
EAN: 9783540428770
Binding: Paperback
Manufacturer: Springer
Studio: Springer
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.
Related Posts
Leave a Reply
You must be logged in to post a comment.
