A set covering approach to metallurgical grade assignment
- 1 January 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 38 (1) , 27-34
- https://doi.org/10.1016/0377-2217(89)90465-7
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Efficient heuristic algorithms for the weighted set covering problemComputers & Operations Research, 1981
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- The Set-Covering Problem: A New Implicit Enumeration AlgorithmOperations Research, 1977
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Heuristic Programming as an Aid to Network DesignNetworks, 1975
- An Algorithm for Large Set Partitioning ProblemsManagement Science, 1974
- An Efficient Branch and Bound Algorithm for the Warehouse Location ProblemManagement Science, 1972
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971