Pages that link to "Item:Q1356937"
From MaRDI portal
The following pages link to How good are convex hull algorithms? (Q1356937):
Displaying 18 items.
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- A complete description of cones and polytopes including hypervolumes of all facets of a polytope (Q4928893) (← links)
- Computational experience with the reverse search vertex enumeration algorithm (Q4946698) (← links)
- Continuous Maps from Spheres Converging to Boundaries of Convex Hulls (Q4965873) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- On the no-signaling approach to quantum nonlocality (Q5245222) (← links)
- Forbidden Vertices (Q5252224) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)
- Partial identification in nonseparable binary response models with endogenous regressors (Q6108266) (← links)
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square (Q6204466) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
- Double description method revisited (Q6567674) (← links)
