Pages that link to "Item:Q3313620"
From MaRDI portal
The following pages link to The Complexity of Vertex Enumeration Methods (Q3313620):
Displaying 45 items.
- Computational complexity of norm-maximization (Q757258) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
- A graphical study of comparative probabilities (Q825132) (← links)
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Multi-criteria analysis with partial information about the weighting coefficients (Q1129899) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- A general algorithm for determining all essential solutions and inequalities for any convex polyhedron (Q1339125) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- The harmonic polytope (Q2238223) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Maximal admissible faces and asymptotic bounds for the normal surface solution space (Q2431613) (← links)
- Which nonnegative matrices are slack matrices? (Q2435500) (← links)
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- Computing shadow prices with multiple Lagrange multipliers (Q2666654) (← links)
- Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
- Optimizing the double description method for normal surface enumeration (Q3584785) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- Interpreting linear systems of equalities and inequalities. Application to the water supply problem (Q3618042) (← links)
- A Calculation of all Separating Hyperplanes of two Convex Polytopes (Q4342958) (← links)
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets (Q4397408) (← links)
- Separating support hyperplanes for a pair of convex polyhedral sets (Q4397409) (← links)
- <i>H</i> <sub>∞</sub> PID controller design for Lur’e systems and its application to a ball and wheel apparatus (Q4652127) (← links)
- A complete description of cones and polytopes including hypervolumes of all facets of a polytope (Q4928893) (← links)
- (Q5009558) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)