A simple strategy for solving a class of 0–1 integer programming models
- 31 December 1986
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 13 (6) , 707-712
- https://doi.org/10.1016/0305-0548(86)90076-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A heuristic with tie breaking for certain 0–1 integer programming modelsNaval Research Logistics Quarterly, 1985
- Priority Scheduling and Spares Stocking Policies for a Repair Shop: The Multiple Failure CaseManagement Science, 1984
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming ProblemsManagement Science, 1975
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958