Zero-one integer programs with few constraints —Lower bounding theory
- 31 August 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 21 (2) , 213-224
- https://doi.org/10.1016/0377-2217(85)90033-5
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Calculating surrogate constraintsMathematical Programming, 1980
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- A Sequential Approach to the $0 - 1$ Linear Programming ProblemSIAM Journal on Applied Mathematics, 1976
- Computational experience with a modification of an algorithm by Hammer and Rudeanu for 0-1 linear programmingPublished by Association for Computing Machinery (ACM) ,1971
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumerationCommunications of the ACM, 1968
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963