A new algorithm to find all vertices of a polytope
From MaRDI portal
Recommendations
Cites work
- A Successive Underestimation Method for Concave Minimization Problems
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An outer approximation method for globally minimizing a concave function over a compact convex set
- scientific article; zbMATH DE number 3774429 (Why is no real title available?)
- scientific article; zbMATH DE number 1768783 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
Cited in
(6)- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- On-line and off-line vertex enumeration by adjacency lists
- Constructing the set of efficient objective values in linear multiple objective transportation problems
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
- A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
- scientific article; zbMATH DE number 761902 (Why is no real title available?)
This page was built for publication: A new algorithm to find all vertices of a polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314411)