Proximity bounds for random integer programs
From MaRDI portal
Publication:5918434
DOI10.1007/978-3-030-73879-2_29zbMath1483.90080OpenAlexW3163270655MaRDI QIDQ5918434
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15924
Related Items (1)
Cites Work
- 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
This page was built for publication: Proximity bounds for random integer programs