A Sequential Approach to the $0 - 1$ Linear Programming Problem
- 1 September 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 31 (2) , 271-285
- https://doi.org/10.1137/0131022
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Zero-one programming using non-binary tree-searchThe Computer Journal, 1971
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- Direct Search Algorithms for Zero-One and Mixed-Integer ProgrammingOperations Research, 1967
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A primal (all-integer) integer programming algorithmJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965