Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
From MaRDI portal
Publication:4973054
DOI10.1145/3340322zbMath1454.90029arXiv1707.00481OpenAlexW2985292442WikidataQ124831686 ScholiaQ124831686MaRDI QIDQ4973054
Robert Weismantel, Friedrich Eisenbrand
Publication date: 2 December 2019
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.00481
Related Items (17)
Tightness of sensitivity and proximity bounds for integer linear programs ⋮ Improving the Cook et al. proximity bound given integral valued constraints ⋮ A note on a variant of the online open end bin packing problem ⋮ A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) ⋮ On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases ⋮ High-multiplicity \(N\)-fold IP via configuration LP ⋮ Hedonic diversity games: a complexity picture with more than two colors ⋮ Optimizing low dimensional functions over the integers ⋮ Block-structured integer programming: can we parameterize without the largest coefficient? ⋮ Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Proximity bounds for random integer programs ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ Proximity bounds for random integer programs ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ More on change-making and related problems
This page was built for publication: Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
