A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Exact Volume Computation for Polytopes: A Practical StudyPublished by Springer Nature ,2000
- The vertex set of a 01-polytope is strongly P-enumerableComputational Geometry, 1998
- Primal—Dual Methods for Vertex and Facet EnumerationDiscrete & Computational Geometry, 1998
- Computational experience with the reverse search vertex enumeration algorithmOptimization Methods and Software, 1998
- How good are convex hull algorithms?Computational Geometry, 1997
- Lectures on PolytopesPublished by Springer Nature ,1995
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- Combinatorial Analysis and ComputersThe American Mathematical Monthly, 1965