Polyhedral computation
- Providence, R.I. : American Mathematical Society, c2009.
- 1 online resource (ix, 147 p. : ill. (some col.))
- CRM Proceedings and Lecture Notes, v. 48 2472-4890 .
Papers presented at a workshop held in Montreal, Oct. 17-20, 2006.
Includes bibliographical references.
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?"
9781470417741 (online)
Polyhedra
Polyhedra
Polyhedral functions
Papers presented at a workshop held in Montreal, Oct. 17-20, 2006.
Includes bibliographical references.
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?"
9781470417741 (online)
Polyhedra
Polyhedra
Polyhedral functions