On-line and off-line vertex enumeration by adjacency lists
- 31 October 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (7) , 403-409
- https://doi.org/10.1016/0167-6377(91)90042-n
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new algorithm to find all vertices of a polytopeOperations Research Letters, 1989
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimizationOperations Research Letters, 1988
- Global optimization under Lipschitzian constraintsJapan Journal of Applied Mathematics, 1987
- Concave Minimization Via Collapsing PolytopesOperations Research, 1986
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976