Page cuts for integer interval linear programming
- 30 September 1979
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 1 (1-2) , 1-14
- https://doi.org/10.1016/0166-218x(79)90011-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Trivial integer programs unsolvable by branch-and-boundMathematical Programming, 1974
- Technical Note—Strengthened Dantzig Cuts for Integer ProgrammingOperations Research, 1972
- A finiteness proof for modified dantzig cuts in integer programmingNaval Research Logistics Quarterly, 1970
- A suboptimization method for interval linear programming: a new method for linear programmingLinear Algebra and its Applications, 1970
- An Explicit Solution of a Special Class of Linear Programming ProblemsOperations Research, 1968
- Note on solving linear programs in integersNaval Research Logistics Quarterly, 1959
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952