scientific article; zbMATH DE number 4006346

MaRDI QIDQ3757974zbMATH OpenFDO

Authors R. Kannan, László Lovász

Publication date 1986

zbMATH Keywords

integer programmingcovering minimabounds on the width of lattice point free convex bodies

Mathematics Subject Classification ID

Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31)

Recommendations

• Covering minima and lattice-point-free convex bodies
• Packing minima and lattice points in convex bodies
• scientific article; zbMATH DE number 922411
• A Minkowski-type theorem for covering minima in the plane
• Minkowski's Convex Body Theorem and Integer Programming

Cited in

(17)

• The isodiametric problem for lattice-point-free convex sets
• Blowing up convex sets in the plane
• Cutting-plane proofs in polynomial space
• Minkowski's Convex Body Theorem and Integer Programming
• Covering minima and lattice-point-free convex bodies
• Covering convex bodies by cylinders and lattice points by flats
• A sharp upper bound for the lattice programming gap
• New techniques for linear arithmetic: cubes and equalities
• scientific article; zbMATH DE number 1054789 (Why is no real title available?)
• Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies
• Minimal Fixing Systems for Convex Bodies
• Fast cube tests for LIA constraint solving
• Minimal covers of the prisms and antiprisms
• The covering radius and a discrete surface area for non-hollow simplices
• The (not so) trivial lifting in two dimensions
• Non-standard approaches to integer programming
• Covering Points with Convex Sets of Minimum Size

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)