Efficient enumeration of the vertices of polyhedra associated with network LPs

Efficient enumeration of the vertices of polyhedra associated with network LPs

0.00 Avg rating0 Votes
Article ID: iaor19951897
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 47
End Page Number: 64
Publication Date: Jan 1994
Journal: Mathematical Programming (Series A)
Authors:
Abstract:

Algorithms are given to list the vertices of polyhedra associated with network linear programs and their duals. Each algorithm has running time which is quadratic in the number of vertices of the polyhedron, and does not require that the polyhedron be either bounded or simple. The algorithms use characterizations of adjacent vertices in network and dual network LPs to perform an efficient traversal of the edge graph of the polyhedron. This contrasts with algorithms for enumerating the vertices of a general polyhedron, all of which have worst-case complexity which is exponential in the number of vertices of the polyhedron.

Reviews

Required fields are marked *. Your email address will not be published.