Efficient heuristic algorithms for the weighted set covering problem
- 31 December 1981
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 8 (4), 303-310
- https://doi.org/10.1016/0305-0548(81)90017-4
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Exact solution of crew scheduling problems using the set partitioning model: Recent successful applicationsNetworks, 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
- Efficient Heuristic Solutions to an Airline Crew Scheduling ProblemA I I E Transactions, 1979
- Set Partitioning: A surveySIAM Review, 1976
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- An Algorithm for Large Set Partitioning ProblemsManagement Science, 1974
- A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew SchedulingTransportation Science, 1973
- The Airline Crew Scheduling Problem: A SurveyTransportation Science, 1969
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965