A bounded dual (all‐integer) integer programming algorithm with an objective cut
- 1 June 1983
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 30 (2) , 271-281
- https://doi.org/10.1002/nav.3800300208
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Generated Cut for Primal Integer ProgrammingOperations Research, 1974
- Iteration Skipping in Primal Integer ProgrammingOperations Research, 1974
- Technical Note—A Counterexample to the Rudimentary Primal Integer Programming AlgorithmOperations Research, 1971
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General AlgorithmOperations Research, 1968
- A primal (all-integer) integer programming algorithmJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMSProceedings of the National Academy of Sciences, 1965
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958