Polyhedral computation

Contributor(s): Avis, David | Bremner, D | Deza, AntoineMaterial type: Computer fileComputer fileSeries: CRM Proceedings and Lecture Notes ; v. 48Publication details: Providence, R.I. : American Mathematical Society, c2009Description: 1 online resource (ix, 147 p. : ill. (some col.))ISBN: 9781470417741 (online)Subject(s): Polyhedra | Polyhedra | Polyhedral functionsOnline resources: Click here to access online
Contents:
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?"
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number URL Status Date due Barcode Item holds
electronic book electronic book
Link to resource Accessible Online EBK20991
Total holds: 0

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?"

There are no comments on this title.

to post a comment.