Computational Combinatorial Optimization Optimal or Provably Near-Optimal Solutions /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Jünger, Michael (Editor, http://id.loc.gov/vocabulary/relators/edt), Naddef, Denis (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Edition: 1st ed. 2001.
• Series: Lecture Notes in Computer Science, 2241
• Subjects: 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.

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 a...