1 |
U. Aickelin, "An indirect genetic algorithm for set covering problems," Journal of the Operational Research Society 53, pp. 1118- 1126, 2002.
DOI
ScienceOn
|
2 |
L. Lessing, I. Dumitrescu, T. Stutzle, "A comparison between ACO algorithms for the set covering problem," Lecture Notes in Computer Science 3172, pp. 1-12, 2004.
DOI
ScienceOn
|
3 |
F. Glover, M. Laguna, Tabu Search, Springer, pp.2-5. 1998
|
4 |
R. L. Radin, Omptimization in Operations Research, Pearson Education, pp. 567, 1998.
|
5 |
M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, USA. 1979.
|
6 |
M. Desrochers, Y. Dumas, F. Soumis, and P. Trudeau, "Column Generatino Approaches to Ariline Crew Scheduling Problems," TRISTAN Conference, Montreal, 1991.
|
7 |
A. Capara, M. Fischetti, P. Toth, D. Vigo, P. L. Guida, "Algorithms for railway crew management," Mathematical Programming 79, pp. 125-.141. 1997.
|
8 |
M. Fisher, P. Kedia, "Optimal solution of set covering/partitioning problems using dual heuristics," management Science 36, pp. 674- 688, 1990.
DOI
ScienceOn
|
9 |
V. Chvatal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research 4, pp. 233-.235. 1979.
DOI
|
10 |
F. J. Vasko, G. R. Wilson, "An efficient heuristic for large set covering problems," Naval Research Logistics Quarterly 31, pp. 163 -171, 1984.
DOI
ScienceOn
|
11 |
L. Jacobs, M. Brusco, "Note: A local-search heuristic for large set-covering problems," Naval Research Logistics 42, pp. 1129-1140. 1995.
DOI
ScienceOn
|
12 |
J. E. Beasley, P. C. Chu, "A genetic algorithm for the set covering problem," European Journal of Operational Research 94, 392-404., 1996.
DOI
ScienceOn
|