Improving proximity bounds using sparsity

DOI10.1007/978-3-030-53262-8_10zbMath1458.90478arXiv2001.04659OpenAlexW3044154680MaRDI QIDQ2225054

Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu

Publication date: 4 February 2021

Full work available at URL: https://arxiv.org/abs/2001.04659

zbMATH Keywords

mixed integer programmingproximitysparsity

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (8)

Tightness of sensitivity and proximity bounds for integer linear programs ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Improving the Cook et al. proximity bound given integral valued constraints ⋮ Advances on strictly \(\varDelta \)-modular IPs ⋮ A colorful Steinitz lemma with application to block-structured integer programs ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Distance-Sparsity Transference for Vertices of Corner Polyhedra ⋮ An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem

This page was built for publication: Improving proximity bounds using sparsity