Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron
Authors:
- Komei FukudaKFKomei Fukuda
- Thomas M. LieblingTLThomas M. Liebling
- François MargotFMFrançois Margot
- 1 June 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 8 (1) , 1-12
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Segments in enumerating facesMathematical Programming, 1995
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, 1994
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- Finding all minimum‐cost perfect matchings in Bipartite graphsNetworks, 1992
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- Some NP-complete problems in linear programmingOperations Research Letters, 1982
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961