On Proximity for k-Regular Mixed-Integer Linear Optimization

DOI10.1007/978-3-030-21803-4_44zbMath1429.90044OpenAlexW2951974044MaRDI QIDQ5214422

Luze Xu, Jon Lee

Publication date: 7 February 2020

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21803-4_44

zbMATH Keywords

proximity\(k\)-regularmixedinteger linear optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items (3)

Proximity in concave integer quadratic programming ⋮ Improving the Cook et al. proximity bound given integral valued constraints ⋮ The Distributions of Functions Related to Parametric Integer Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some proximity and sensitivity results in quadratic integer programming
• Integer program with bimodular matrix
• The incidence structure of subspaces with well-scaled frames
• Subspaces with well-scaled frames
• The relationship between integer and real solutions of constrained convex programming
• Distances to lattice points in knapsack polyhedra
• Distances between optimal solutions of mixed-integer programs
• Sensitivity theorems in integer linear programming
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: On Proximity for k-Regular Mixed-Integer Linear Optimization