|Table of Contents|| || || || || || |
CRM Proceedings & Lecture Notes
2009; 147 pp; softcover
List Price: US$79
Member Price: US$63.20
Order Code: CRMP/48
Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Levent Tuncel
Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general-purpose algorithms. They are, however, highly structured, and attention has turned to exploiting this structure, particularly symmetry. Initial applications of this approach have permitted computations previously far out of reach, but much remains to be understood and validated experimentally.
The papers in this volume give a good snapshot of the ideas discussed at a Workshop on Polyhedral Computation held at the CRM in Montréal in October 2006 and, with one exception, the current state of affairs in this area. The exception is the inclusion of an often cited 1980 technical report of Norman Zadeh, which was never published in a journal and has passed into the folklore of the discipline. This paper illustrates beautifully the work still to be done in the field: it gives a simple pivot rule for the simplex method for which it is still unknown if it yields a polynomial time algorithm.
Titles in this series are co-published with the Centre de Recherches Mathématiques.
Graduate students and research mathematicians interested in discrete and computational geometry, combinatorial and continuous optimization, linear programming, enumeration algorithms, and computational complexity.
AMS Home |
© Copyright 2014, American Mathematical Society