Polyhedral Computation
( CRM Proceedings & Lecture Notes )
Publication series ：CRM Proceedings & Lecture Notes
Author： David Avis;David Bremner;Antoine Deza
Publisher： American Mathematical Society
Publication year： 2015
E-ISBN: 9781470417741
P-ISBN(Paperback): 9780821846339
Subject： O1 Mathematics
Keyword： 暂无分类
Language： ENG
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Polyhedral Computation
Description
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.
Chapter