Pages that link to "Item:Q1977743"
From MaRDI portal
The following pages link to Distances between non-symmetric convex bodies and the \(MM^*\)-estimate (Q1977743):
Displaying 34 items.
- On integer programming with bounded determinants (Q315478) (← links)
- The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
- Rogers-Shephard inequality for log-concave functions (Q329690) (← links)
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- On approximation by projections of polytopes with few facets (Q476495) (← links)
- Volume inequalities for the \(i\)-th-convolution bodies (Q481972) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- On the extremal distance between two convex bodies (Q636023) (← links)
- Covering convex bodies by cylinders and lattice points by flats (Q836226) (← links)
- Entropy and asymptotic geometry of non-symmetric convex bodies (Q1578074) (← links)
- Covering the boundary of a convex body with its smaller homothetic copies (Q1625798) (← links)
- On Banach-Mazur distance between planar convex bodies (Q1784272) (← links)
- A characterization of the \(MM^*\)-position of a convex body in terms of covariance matrices (Q1885653) (← links)
- Asymptotic estimates for the largest volume ratio of a convex body (Q1982553) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
- Banach-Mazur distance from the parallelogram to the affine-regular hexagon and other affine-regular even-gons (Q2038605) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Rogers-Shephard type inequalities for sections (Q2306218) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Notes on Schneider's stability estimates for convex sets (Q2441409) (← links)
- Application of an idea of Voronoĭ to John type problems (Q2483170) (← links)
- Relative growth rate and contact Banach-Mazur distance (Q2665219) (← links)
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width (Q2686594) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- The finiteness threshold width of lattice polytopes (Q3389399) (← links)
- (Q5092485) (← links)
- EXTREMAL BANACH–MAZUR DISTANCE BETWEEN A SYMMETRIC CONVEX BODY AND AN ARBITRARY CONVEX BODY ON THE PLANE (Q5112814) (← links)
- Hollow polytopes of large width (Q5210954) (← links)
- Entanglement Thresholds for Random Induced States (Q5746484) (← links)
- On the volume ratio of projections of convex bodies (Q6144349) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)