Efficient enumeration of the vertices of polyhedra associated with network LP's
- 1 January 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 63 (1-3) , 47-64
- https://doi.org/10.1007/bf01582058
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- An algorithm for determining all extreme points of a convex polytopeMathematical Programming, 1977
- Vertex Generation Methods for Problems with Logical ConstraintsPublished by Elsevier ,1977
- An algorithm for enumerating all vertices of a convex polyhedronComputing, 1975
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Technical Note—Vertex Generation and Cardinality Constrained Linear ProgramsOperations Research, 1975
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961