On-line and off-line vertex enumeration by adjacency lists
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
Sorting and Searching
1973 • 1,580 citations
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
1980 • 244 citations
The Complexity of Vertex Enumeration Methods
1983 • 178 citations
A Successive Underestimation Method for Concave Minimization Problems
1976 • 166 citations
A method for globally minimizing concave functions over convex sets
1981 • 126 citations
A General Deterministic Approach to Global Optimization VIA D.C. Programming
1986 • 81 citations
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
1988 • 74 citations
An Outer Approximation Method for Globally Minimizing a Concave Function over a Compact Convex Set
1983 • 59 citations
Concave Minimization Via Collapsing Polytopes
1986 • 34 citations
Fermat Days 85: Mathematics for Optimization
1986 • 24 citations
Global optimization under Lipschitzian constraints
1987 • 21 citations
A new algorithm to find all vertices of a polytope
1989 • 15 citations