Pages that link to "Item:Q1688856"
From MaRDI portal
The following pages link to On the combinatorial complexity of approximating polytopes (Q1688856):
Displaying 6 items.
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- (Q5009560) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
