Heuristically aided set-covering algorithms
- 1 March 1974
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 3 (1) , 59-70
- https://doi.org/10.1007/bf01355587
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971
- A Heuristic Programming Algorithm for Warehouse LocationA I I E Transactions, 1970
- Computer Solutions to Minimum-Cover ProblemsOperations Research, 1969
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- An application of linear programming to the minimization of Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961