scientific article; zbMATH DE number 4006346
From MaRDI portal
Publication:3757974
zbMATH Open0621.10021MaRDI QIDQ3757974FDOQ3757974
Authors: R. Kannan, László Lovász
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31)
Cited In (17)
- Minimal covers of the prisms and antiprisms
- The (not so) trivial lifting in two dimensions
- Non-standard approaches to integer programming
- Cutting-plane proofs in polynomial space
- Covering convex bodies by cylinders and lattice points by flats
- The isodiametric problem for lattice-point-free convex sets
- Blowing up convex sets in the plane
- Covering minima and lattice-point-free convex bodies
- The covering radius and a discrete surface area for non-hollow simplices
- A sharp upper bound for the lattice programming gap
- New techniques for linear arithmetic: cubes and equalities
- Covering Points with Convex Sets of Minimum Size
- Fast cube tests for LIA constraint solving
- Minkowski's Convex Body Theorem and Integer Programming
- Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies
- Title not available (Why is that?)
- Minimal Fixing Systems for Convex Bodies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757974)