A lagrangian heuristic for set-covering problems
- 1 February 1990
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 37 (1), 151-164
- https://doi.org/10.1002/1520-6750(199002)37:1<151::aid-nav3220370110>3.0.co;2-2
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- An Applications Oriented Guide to Lagrangian RelaxationInforms Journal on Applied Analytics, 1985
- Worst case analysis of a class of set covering heuristicsMathematical Programming, 1982
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- Efficient heuristic algorithms for the weighted set covering problemComputers & Operations Research, 1981
- Computational results for very large air crew scheduling problemsOmega, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- The Set-Covering Problem: A New Implicit Enumeration AlgorithmOperations Research, 1977
- Note—A Computational Survey of Methods for the Set Covering ProblemManagement Science, 1975