Zero-one programming with many variables and few constraints
- 1 May 1978
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 2 (3) , 195-201
- https://doi.org/10.1016/0377-2217(78)90093-0
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Experimental results on Hillier's linear searchMathematical Programming, 1975
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972
- Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit EnumerationOperations Research, 1970
- Efficient Heuristic Procedures for Integer Linear Programming with an InteriorOperations Research, 1969
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Methods for the Solution of the Multidimensional 0/1 Knapsack ProblemOperations Research, 1967
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965