Pages that link to "Item:Q1356937"
From MaRDI portal
The following pages link to How good are convex hull algorithms? (Q1356937):
Displayed 17 items.
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Converting between quadrilateral and standard solution sets in normal surface theory (Q1035322) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- A reverse search algorithm for the neighborhood problem (Q1306348) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Multiparametric demand transportation problem (Q1604061) (← links)
- Dealing with imprecise information in group multicriteria decisions: a methodology and a GDSS architecture (Q1887887) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- A validation and verification tool for global optimization solvers (Q3598649) (← links)
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR (Q3644940) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)