AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization
About this Title
Levent Tunçel, University of Waterloo, Waterloo, ON, Canada
Publication: Fields Institute Monographs
Publication Year:
2010; Volume 27
ISBNs: 978-1-4704-2811-2 (print); 978-1-4704-1790-1 (online)
DOI: https://doi.org/10.1090/fim/027
MathSciNet review: MR2724357
MSC: Primary 90-02; Secondary 05C85, 68W25, 90C05, 90C20, 90C22, 90C27, 90C57
Table of Contents
Download chapters as PDF
Front/Back Matter
Chapters
- Chapter 1. Introduction
- Chapter 2. Duality theory
- Chapter 3. Ellipsoid method
- Chapter 4. Primal-dual interior-point methods
- Chapter 5. Approximation algorithms based on SDP
- Chapter 6. Geometric representations of graphs
- Chapter 7. Lift-and-project procedures for combinatorial optimization problems
- Chapter 8. Lift-and-project ranks for combinatorial optimzation
- Chapter 9. Successive convex relaxation methods
- Chapter 10. Connections to other areas of mathematics
- Chapter 11. An application to discrepancy theory
- Chapter 12. SDP representability