Efficient heuristic algorithms for the weighted set covering problem
暂无分享,去创建一个
[1] E. Balas,et al. Set Partitioning: A survey , 1976 .
[2] J. P. Arabeyre,et al. The Airline Crew Scheduling Problem: A Survey , 1969 .
[3] J. Rubin. A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .
[4] Roy E. Marsten,et al. Crew Planning at Flying Tiger: A Successful Application of Integer Programming , 1979 .
[5] Roy E. Marsten,et al. Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.
[6] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[7] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[8] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[9] Edward Keefer Baker,et al. Efficient heuristic solutions for the airline crew scheduling problem , 1979 .
[10] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .
[11] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[12] R. E. Marsten. An Algorithm for Large Set Partitioning Problems , 1974 .