Distances between optimal solutions of mixed-integer programs
Authors:
- 21 August 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 179 (1-2) , 455-468
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Alexander von Humboldt-Stiftung
This publication has 11 references indexed in Scilit:
- Integer Programming2014
- Integer program with bimodular matrixDiscrete Optimization, 2009
- Refined proximity and sensitivity results in linearly constrained convex separable integer programmingLinear Algebra and its Applications, 1995
- The relationship between integer and real solutions of constrained convex programmingMathematical Programming, 1991
- Convex separable optimization is not much harder than linear optimizationJournal of the ACM, 1990
- Some proximity and sensitivity results in quadratic integer programmingMathematical Programming, 1990
- Sensitivity theorems in integer linear programmingMathematical Programming, 1986
- The value function of a mixed integer program: IIDiscrete Mathematics, 1979
- The value function of a mixed integer program: IDiscrete Mathematics, 1977
- A combinatorial problem on finite Abelian groups, IJournal of Number Theory, 1969