Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Jünger, Michael (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Naddef, Denis (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2241
• Θέματα: Mathematical optimization.; Computer science-Mathematics.; Algorithms.; Information technology.; Business-Data processing.; Data structures (Computer science).; Combinatorics.; Optimization.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; IT in Business.; Data Structures.
• Φυσική περιγραφή: X, 310 p. online resource.
• ISBN: 9783540455868
• ISSN: 0302-9743 ;
• DOI: 10.1007/3-540-45586-8

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.