An adaptation of SH heuristic to the location set covering problem
暂无分享,去创建一个
[1] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[2] J. Beasley. A lagrangian heuristic for set‐covering problems , 1990 .
[3] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .
[4] Charles S. ReVelle,et al. The Location of Emergency Service Facilities , 1971, Oper. Res..
[5] Marcos Almiñana Alemany. Nuevos heurísticos para la resolución del problema del cubrimiento total , 1994 .
[6] L. A. Lorena,et al. A surrogate heuristic for set covering problems , 1994 .
[7] Gautam Mitra,et al. Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations , 1992 .
[8] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[9] Antonio Sassano,et al. A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..
[10] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[11] M. Fisher,et al. Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .
[12] Kurt Mehlhorn,et al. Graph Algorithm and NP-Completeness , 1984 .
[13] J. Beasley,et al. Enhancing an algorithm for set covering problems , 1992 .
[14] Francis J. Vasko,et al. An efficient heuristic for large set covering problems , 1984 .
[15] Jesús T. Pastor,et al. Two new heuristics for the location set covering problem , 1994 .
[16] J. Beasley. An algorithm for set covering problem , 1987 .
[17] F. J. Vasko,et al. Hybrid heuristics for minimum cardinality set covering problems , 1986 .
[18] R. Roth,et al. Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..
[19] Nicos Christofides,et al. Algorithms for large scale set covering problems , 1993, Ann. Oper. Res..
[20] E. El-Darzi. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms , 1988 .
[21] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[22] Matteo Fischetti,et al. A Heuristic Algorithm for the Set Covering Problem , 1996, IPCO.