摘要: The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. In this survey, we focus our …
springer.com
sci-hub.se 参考文章(27)
Egon Balas, A class of location, distribution and scheduling problems : modeling and solution methods 21 p., 8 + 4 p. of appendix : ill. Carnegie Mellon University, Pittsburgh, PA: Design Research Center, December, 1982. includes bibliography. ,(1982)
Paolo Nobili, Antonio Sassano, A Separation Routine for the Set Covering Polytope. integer programming and combinatorial optimization. pp. 201- 219 ,(1992)
M.J. Brusco, L.W. Jacobs, G.M. Thompson, A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems Annals of Operations Research. ,vol. 86, pp. 611- 627 ,(1999) , 10.1023/A:1018900128545
Larry W. Jacobs, Michael J. Brusco, Note: A local-search heuristic for large set-covering problems Naval Research Logistics. ,vol. 42, pp. 1129- 1140 ,(1995) , 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M
Dag Wedelin, An algorithm for large scale 0-1 integer programming with application to airline crew scheduling Annals of Operations Research. ,vol. 57, pp. 283- 301 ,(1995) , 10.1007/BF02099703
J.E. Beasley, An algorithm for set covering problem European Journal of Operational Research. ,vol. 31, pp. 85- 93 ,(1987) , 10.1016/0377-2217(87)90141-X
Hai D. Chu, Eric Gelman, Ellis L. Johnson, Solving Large Scale Crew Scheduling Problems European Journal of Operational Research. ,vol. 97, pp. 260- 268 ,(1997) , 10.1016/S0377-2217(96)00196-8
Marshall L. Fisher, An Applications Oriented Guide to Lagrangian Relaxation Interfaces. ,vol. 15, pp. 10- 21 ,(1985) , 10.1287/INTE.15.2.10
Michael Randolph Garey, Johnson: computers and intractability: a guide to the theory of np- completeness (freeman ,(1979)
Michael Held, Richard M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees Operations Research. ,vol. 18, pp. 1138- 1162 ,(1970) , 10.1287/OPRE.18.6.1138