Pages that link to "Item:Q1344616"
From MaRDI portal
The following pages link to On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616):
Displaying 26 items.
- A collision detection approach for maximizing the material utilization (Q493697) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- On feasible sets for MPC and their approximations (Q629062) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- The Blaschke-Steinhardt point of a planar convex set (Q1339815) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Elementary geometry on the integer lattice (Q1662428) (← links)
- Some clustering algorithms in normed planes (Q1792096) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Symmetric conference matrices and locally largest regular crosspolytopes in cubes (Q1855403) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- On the co-NP-completeness of the zonotope containment problem (Q2068561) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
- Polytopic Discrete-Time Models for Systems with Time-Varying Delays (Q2926537) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
- Diversities and the generalized circumradius (Q6142370) (← links)
