Pages that link to "Item:Q5920505"
From MaRDI portal
The following pages link to Generating all vertices of a polyhedron is hard (Q5920505):
Displaying 36 items.
- Weighted digraphs and tropical cones (Q273146) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Maximal admissible faces and asymptotic bounds for the normal surface solution space (Q2431613) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- On characterizing full dimensional weak facets in DEA with variable returns to scale technology (Q3453412) (← links)
- Optimizing the double description method for normal surface enumeration (Q3584785) (← links)
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
- Sampling and Statistical Physics via Symmetry (Q5021912) (← 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)
- Forbidden Vertices (Q5252224) (← links)
- Revisited aspects of the local set in CHSH Bell scenario (Q6086666) (← links)
- Robust homecare service capacity planning (Q6109551) (← links)
- Derivative-free optimization of a rapid-cycling synchrotron (Q6173802) (← links)
- Gorenstein braid cones and crepant resolutions (Q6204770) (← links)
- Deep learning the efficient frontier of convex vector optimization problems (Q6618150) (← links)
