Proximity and flatness bounds for linear integer optimization

DOI10.1287/MOOR.2022.0335MaRDI QIDQ7036448zbMATH OpenFDO

Authors Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel

Publication date 28 January 2025

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://orca.cardiff.ac.uk/id/eprint/166862/1/ProxFacetRevision.pdf

zbMATH Keywords

bounded determinantsinteger programmingproximitywidth

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Linear programming (90C05) Integer programming (90C10)

Cited in

(4)

• Totally -modular IPs with two non-zeros in most rows
• Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
• On matrices over a polynomial ring with restricted subdeterminants
• A threshold phenomenon for the shortest lattice vector problem in the infinity norm

This page was built for publication: Proximity and flatness bounds for linear integer optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7036448)