Double description method revisited
From MaRDI portal
Publication:6567674
Recommendations
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- New modification of the double description method for constructing the skeleton of a polyhedral cone
- Average-case analysis of the double description method and the beneath-beyond algorithm
- Two variations of graph test in double description method
- The Complexity of Vertex Enumeration Methods
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- How good are convex hull algorithms?
- The Complexity of Vertex Enumeration Methods
- The inequicut cone
Cited in
(3)
This page was built for publication: Double description method revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567674)