Polyhedral and semidefinite programming methods in combinatorial optimization / Levent Tunçel.

Format:

Book

Author/Creator:

Tuncel, Levent, 1965- author.

Series:

Fields Institute monographs ; 27.

Fields Institute Monographs, 2472-4173 ; v. 27

Language:

English

Subjects (All):

Semidefinite programming.

Combinatorial optimization.

Convex geometry.

Physical Description:

1 online resource (x, 219 pages)

Place of Publication:

Providence, R.I. : American Mathematical Society ; Toronto, Ont. : Fields Institute for Research in Mathematical Sciences, c2010.

System Details:

Mode of access : World Wide Web

Contents:

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

Notes:

Includes bibliographical references (pages 203-216) and index.

Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012

Description based on print version record.

Other Format:

Print version: Tuncel, Levent, 1965- Polyhedral and semidefinite programming methods in combinatorial optimization /

ISBN:

9781470417901 (online)

Access Restriction:

Restricted for use by site license.