AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Polyhedral Computation
About this Title
David Avis, McGill University, Montréal, QC, Canada, David Bremner, University of New Brunswick, Fredericton, NB, Canada and Antoine Deza, McMaster University, Hamilton, ON, Canada, Editors
Publication: CRM Proceedings and Lecture Notes
Publication Year:
2009; Volume 48
ISBNs: 978-0-8218-4633-9 (print); 978-1-4704-1774-1 (online)
DOI: https://doi.org/10.1090/crmp/048
MathSciNet review: MR2541858
MSC: Primary 52-06; Secondary 05C20, 52B12, 52B55, 68U05, 90C57
Table of Contents
Front/Back Matter
Chapters
- On combinatorial properties of linear program digraphs
- Generating vertices of polyhedra and related problems of monotone generation
- Polyhedral representation conversion up to symmetries
- An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
- Hyperplane arrangements with large average diameter
- Enumerating the Nash equilibria of rank-1 games
- What is the worst case behavior of the simplex algorithm?
- Postscript to "What is the worst case behavior of the simplex algorithm?"