Semidefinite Programs and Combinatorial Optimization
- L. Lovász
Linear programming has been one of the most fundamental and successful tools in optimization and discrete mathematics. Its applications include exact and approximation algorithms, as well as structural results and estimates. The key point is that linear programs are very efficiently solvable, and have a powerful duality theory.
- Semidefinite Programs and Combinatorial Optimization
- Book Title
- Recent Advances in Algorithms and Combinatorics
- pp 137-194
- Print ISBN
- Online ISBN
- Series Title
- CMS Books in Mathematics / Ouvrages de mathématiques de la SMC
- Series ISSN
- Springer New York
- Copyright Holder
- Springer-Verlag New York, Inc.
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.