Polyhedral Computation (Crm Proceedings & Lecture Notes)

David Avis, David Bremner, and Antoine Deza

ISBN 10: 0821846337 / ISBN 13: 9780821846339

Published by American Mathematical Society, 2009

About this Item

Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general-purpose algorithms. This title contains the papers that give a snapshot of the ideas discussed at a Workshop on Polyhedral Computation held at the CRM in Montreal in October 2006. Editor(s): Avis, David; Bremner, David; Deza, Antoine. Series: CRM Proceedings & Lecture Notes. Num Pages: 147 pages, Illustrations (some col.). BIC Classification: PBM; PBP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 308. . 2009. Paperback. . . . . Books ship from the US and Ireland.

Seller Inventory # V9780821846339

Bibliographic Details

• Title: Polyhedral Computation (Crm Proceedings & Lecture Notes)
• Publisher: American Mathematical Society
• Publication Date: 2009
• Language: English
• ISBN 10: 0821846337
• ISBN 13: 9780821846339
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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 Montreal 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.