Proximity bounds for random integer programs

DOI10.1007/s10107-022-01786-8OpenAlexW4220796624MaRDI QIDQ5925654

Martin Henk, Marcel Celaya

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01786-8

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The distribution of sublattices of \(\mathbb{Z}^m\)
• Distances to lattice points in knapsack polyhedra
• Feasibility of Integer Knapsacks
• Sensitivity theorems in integer linear programming
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• The Distributions of Functions Related to Parametric Integer Optimization
• Asymptotic Geometric Analysis, Part I
• Convex and Discrete Geometry
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Proximity bounds for random integer programs
• On the integrality gap of binary integer programs with Gaussian data

This page was built for publication: Proximity bounds for random integer programs