Efficient heuristic algorithms for the weighted set covering problem
References (17)
Approximation algorithms for combinatorial problems
J. Comput. System Sci.
(1974)- et al.
The airline crew scheduling problem: a survey
Transportation Sci.
(1969) Efficient heuristic solutions to airline crew scheduling problems. Doctoral Dissertation, College of Business and Management
(1979)- et al.
Efficient heuristic solutions to an airline crew schedulin gproblem
AIIE Trans.
(1979) - et al.
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study
Math. Prog. Study
(1980) - et al.
Set partitioning: a survey
SIAM Rev.
(1976) A greedy heuristic for the set-covering problem
Math. Ops. Res.
(1979)- et al.
Scheduling of vehicles from a central depot to a number of delivery points
Opers Res.
(1964)
There are more references available in the full text version of this article.
Cited by (0)
- †
Edward Baker is an Assistant Professor of Management Science in the School of Business Administration at the University of Miami. He received B.E.S and M.S. degrees from Johns Hopkins University and a DBA from the University of Maryland. His research interests include integer programming, networks, and applications of operations research to problems in transportation and finance.
Copyright © 1981 Published by Elsevier Ltd.