Improving the Cook et al. proximity bound given integral valued constraints

DOI10.1007/978-3-031-06901-7_7zbMath1497.90128arXiv2111.01782OpenAlexW3209317464MaRDI QIDQ2164682

Marcel Celaya, Joseph Paat, Stefan Kuhlmann, Robert Weismantel

Publication date: 16 August 2022

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

zbMATH Keywords

integral matrixlargest magnitude of any subdeterminant

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (2)

Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ New Bounds for the Integer Carathéodory Rank

Cites Work

• Unnamed Item
• A counterexample to the Hirsch conjecture
• Some proximity and sensitivity results in quadratic integer programming
• Integer program with bimodular matrix
• The relationship between integer and real solutions of constrained convex programming
• Proximity in concave integer quadratic programming
• Distances to lattice points in knapsack polyhedra
• Improving proximity bounds using sparsity
• Distances between optimal solutions of mixed-integer programs
• The feasibility pump
• Sensitivity theorems in integer linear programming
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• On Integer Programming and Convolution.
• The Distributions of Functions Related to Parametric Integer Optimization
• Distance-Sparsity Transference for Vertices of Corner Polyhedra
• On Proximity for k-Regular Mixed-Integer Linear Optimization
• Convex and Discrete Geometry
• Convex separable optimization is not much harder than linear optimization
• A theorem on transfer for convex bodies

This page was built for publication: Improving the Cook et al. proximity bound given integral valued constraints