scientific article; zbMATH DE number 4006346

zbMATH Open0621.10021MaRDI QIDQ3757974FDOQ3757974

R. Kannan, László Lovász

Publication date: 1986

Title of this publication is not available (Why is that?)

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)

Cited In (13)

• Minimal covers of the prisms and antiprisms
• Fast Cube Tests for LIA Constraint Solving
• 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
• New techniques for linear arithmetic: cubes and equalities
• Covering Points with Convex Sets of Minimum Size
• Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies
• Title not available (Why is that?)
• Minimal Fixing Systems for Convex Bodies

   Recommendations

• Covering minima and lattice-point-free convex bodies 👍 👎
• Packing minima and lattice points in convex bodies 👍 👎
• Title not available (Why is that?) 👍 👎
• A Minkowski-type theorem for covering minima in the plane 👍 👎
• Minkowski's Convex Body Theorem and Integer Programming 👍 👎

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)