Combinatorial Optimization
- Rico Zenklusen
- Spring Semester
- Location: rack 16, shelf 0 VVZ-ID: 401-4904-00L Lecture homepage
Combinatorial Optimization deals with efficiently finding a provably strong solution among a finite set of options. This course discusses key combinatorial structures and techniques to design efficient algorithms for combinatorial optimization problems. We put a strong emphasis on polyhedral methods, which proved to be a powerful and unifying tool throughout combinatorial optimization.
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
Combinatorial optimizationPolyhedra and efficiency Alexander Schrijver
|
||||||||||||||||||||||||||||||||||||||||||
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
Combinatorial optimizationTheory and algorithms Bernhard Korte, Jens Vygen
|