Double description method revisited
From MaRDI portal
Publication:6567674
DOI10.1007/3-540-61576-8_77zbMATH Open1543.68253MaRDI QIDQ6567674
Publication date: 5 July 2024
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The inequicut cone
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- How good are convex hull algorithms?
- The Complexity of Vertex Enumeration Methods
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
Related Items (3)
A polyhedral approximation algorithm for recession cones of spectrahedral shadows ⋮ Full-low evaluation methods for bound and linearly constrained derivative-free optimization ⋮ New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
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)
