A heuristic algorithm for the set covering problem
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An algorithm for large scale 0–1 integer programming with application to airline crew schedulingAnnals of Operations Research, 1995
- A surrogate heuristic for set covering problemsEuropean Journal of Operational Research, 1994
- A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,Published by Defense Technical Information Center (DTIC) ,1992
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Optimal Solution of Set Covering/Partitioning Problems Using Dual HeuristicsManagement Science, 1990
- A lagrangian heuristic for set-covering problemsNaval Research Logistics (NRL), 1990
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971