Chapter

Recent Advances in Algorithms and Combinatorics

Part of the series CMS Books in Mathematics / Ouvrages de mathématiques de la SMC pp 137-194

Semidefinite Programs and Combinatorial Optimization

  • L. Lovász

Abstract

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.