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.
Michael Junger & Denis Naddef
Computational Combinatorial Optimization [PDF ebook]
Optimal or Provably Near-Optimal Solutions
Computational Combinatorial Optimization [PDF ebook]
Optimal or Provably Near-Optimal Solutions
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● ISBN 9783540455868 ● Editör Michael Junger & Denis Naddef ● Yayımcı Springer Berlin Heidelberg ● Yayınlanan 2001 ● İndirilebilir 3 kez ● Döviz EUR ● Kimlik 6357041 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir