A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
暂无分享,去创建一个
[1] L. W. Jacobs,et al. Note: A local-search heuristic for large set-covering problems , 1995 .
[2] Morton E. O'Kelly,et al. Locating Emergency Warning Sirens , 1992 .
[3] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[4] J. Beasley. An algorithm for set covering problem , 1987 .
[5] Salim Haddadi,et al. Simple Lagrangian heuristic for the set covering problem , 1997 .
[6] K. Al-Sultan,et al. A Genetic Algorithm for the Set Covering Problem , 1996 .
[7] R. Storer,et al. New search spaces for sequencing problems with application to job shop scheduling , 1992 .
[8] Antonio Sassano,et al. A Separation Routine for the Set Covering Polytope , 1992, IPCO.
[9] Gerald L. Thompson,et al. The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems , 1994, Comput. Oper. Res..
[10] Ana Paias,et al. State space relaxation for set covering problems related to bus driver scheduling , 1993 .
[11] Egon Balas,et al. A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..
[12] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[13] Giovanni Manzini,et al. Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..
[14] Gautam Mitra,et al. Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations , 1992 .
[15] L. A. Lorena,et al. A surrogate heuristic for set covering problems , 1994 .
[16] J. Beasley. A lagrangian heuristic for set‐covering problems , 1990 .
[17] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[18] Antonio Sassano,et al. A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..
[19] George L. Nemhauser,et al. Experiments with parallel branch-and-bound algorithms for the set covering problem , 1993, Oper. Res. Lett..
[20] M. Padberg,et al. Solving airline crew scheduling problems by branch-and-cut , 1993 .
[21] Matteo Fischetti,et al. A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..
[22] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[23] Edward P. K. Tsang,et al. Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..
[24] L A N Lorena,et al. Genetic algorithms applied to computationally difficult set covering problems , 1997 .
[25] Irène Charon,et al. The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..
[26] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[27] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[28] J. Beasley,et al. Enhancing an algorithm for set covering problems , 1992 .
[29] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..