Sensitivity theorems in integer linear programming
Authors:
- 1 April 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 34 (3) , 251-264
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The value function of an integer programMathematical Programming, 1982
- Total dual integrality and integer polyhedraLinear Algebra and its Applications, 1979
- The value function of a mixed integer program: IIDiscrete Mathematics, 1979
- A bound on solutions of linear integer equalities and inequalitiesProceedings of the American Mathematical Society, 1978
- The value function of a mixed integer program: IDiscrete Mathematics, 1977
- On the foundations of linear and integer linear programming IMathematical Programming, 1975
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMSProceedings of the National Academy of Sciences, 1965