On Proximity for k-Regular Mixed-Integer Linear Optimization

DOI10.1007/978-3-030-21803-4_44MaRDI QIDQ5214422zbMATH OpenOpenAlexFDO

Authors 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

\(k\)-regularmixedinteger linear optimizationproximity

Mathematics Subject Classification ID

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

Recommendations

• Proximity search for 0--1 mixed-integer convex programming
• Proximity in concave integer quadratic programming
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Tightness of sensitivity and proximity bounds for integer linear programs
• Distances between optimal solutions of mixed-integer programs
• Integer convex minimization by mixed integer linear optimization
• Two linear approximation algorithms for convex mixed integer nonlinear programming
• Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Proximity bounds for random integer programs

Cites work

• Convex separable optimization is not much harder than linear optimization
• Distances between optimal solutions of mixed-integer programs
• Distances to lattice points in knapsack polyhedra
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 6850361 (Why is no real title available?)
• scientific article; zbMATH DE number 3365043 (Why is no real title available?)
• Integer program with bimodular matrix
• Sensitivity theorems in integer linear programming
• Some proximity and sensitivity results in quadratic integer programming
• Subspaces with well-scaled frames
• The incidence structure of subspaces with well-scaled frames
• The relationship between integer and real solutions of constrained convex programming

Cited in

(6)

• Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Proximity in concave integer quadratic programming
• Improving the Cook et al. proximity bound given integral valued constraints
• Distances between optimal solutions of mixed-integer programs
• The distributions of functions related to parametric integer optimization

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

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