The Complexity of Vertex Enumeration Methods
From MaRDI portal
(Redirected from Publication:3313620)
Recommendations
- How good are convex hull algorithms?
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- On-line and off-line vertex enumeration by adjacency lists
- scientific article; zbMATH DE number 5548206
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Cited in
(70)- Random walks on the vertices of transportation polytopes with constant number of sources
- scientific article; zbMATH DE number 1961535 (Why is no real title available?)
- A graphical study of comparative probabilities
- Incremental convex hull algorithms are not output sensitive
- A framework for the complexity of high-multiplicity scheduling problems
- The complexity of the Kth largest subset problem and related problems
- scientific article; zbMATH DE number 7378671 (Why is no real title available?)
- Hard Enumeration Problems in Geometry and Combinatorics
- Double description method revisited
- Error control in polytope computations
- Some applications of combinatorial optimization in parallel computing
- Estimating the number of vertices of a polyhedron
- Optimizing the double description method for normal surface enumeration
- Beneath-and-Beyond revisited
- scientific article; zbMATH DE number 1538127 (Why is no real title available?)
- The use of edge-directions and linear programming to enumerate vertices
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- Computing shadow prices with multiple Lagrange multipliers
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A portable parallel implementation of the \textit{lrs} vertex enumeration code
- Generating all vertices of a polyhedron is hard
- A basis enumeration algorithm for linear systems with geometric applications
- Bounds on the number of vertices of perturbed polyhedra
- The harmonic polytope
- Which nonnegative matrices are slack matrices?
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Traversing combinatorial 0/1-polytopes via optimization
- H ∞ PID controller design for Lur’e systems and its application to a ball and wheel apparatus
- On-line and off-line vertex enumeration by adjacency lists
- On the optimal mixing problem of approximate Nash equilibria in bimatrix games
- scientific article; zbMATH DE number 482137 (Why is no real title available?)
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Computational complexity of norm-maximization
- An iterative vertex enumeration method for objective space based vector optimization algorithms
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Multi-criteria analysis with partial information about the weighting coefficients
- scientific article; zbMATH DE number 1629817 (Why is no real title available?)
- Interpreting linear systems of equalities and inequalities. Application to the water supply problem
- Eigenpolytope Universality and Graphical Designs
- Separating support hyperplanes for a pair of convex polyhedral sets
- Complexity of approximating the vertex centroid of a polyhedron
- A new algorithm to find all vertices of a polytope
- scientific article; zbMATH DE number 2040941 (Why is no real title available?)
- Selected bibliography on degeneracy
- Computational experience with the reverse search vertex enumeration algorithm
- The complexity of the vertex-minor problem
- Approximate vertex enumeration
- A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
- A method of transferring polyhedron between the intersection-form and the sum-form
- Complexity and algorithms for computing Voronoi cells of lattices
- Segments in enumerating faces
- An efficient algorithm for vertex enumeration of arrangement
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- The shrinking-and-expanding method for the graph enumeration
- Global solution algorithms for DC programming via polyhedral approximations of convex functions
- Monte-Carlo integration on a union of polytopes
- Maximal admissible faces and asymptotic bounds for the normal surface solution space
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- Efficient enumeration of the vertices of polyhedra associated with network LP's
- A complete description of cones and polytopes including hypervolumes of all facets of a polytope
- On the complexity of some basic problems in computational convexity. I. Containment problems
- How good are convex hull algorithms?
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- Enumerative techniques for solving some nonconvex global optimization problems
- scientific article; zbMATH DE number 1393410 (Why is no real title available?)
- Forbidden vertices
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
This page was built for publication: The Complexity of Vertex Enumeration Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313620)
