A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

Computers and Operations Research

Volumn 40, Issue 12, 2013, Pages 3132-3146

  Pessoa, Luciana S ^a   Resende, Mauricio G C ^b   Ribeiro, Celso C ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

GRASP; Hybrid heuristics; Lagrangean heuristics; Lagrangean relaxation; Local search; Metaheuristics; Path relinking; Set covering; Set k covering; Set multicovering

Indexed keywords

GRASP; HYBRID HEURISTICS; LAGRANGEAN HEURISTICS; LAGRANGEAN RELAXATION; LOCAL SEARCH; META HEURISTICS; PATH RELINKING; SET COVERINGS; SET K-COVERING; SET MULTICOVERING;

COMPUTER SCIENCE; OPERATIONS RESEARCH;

BIOINFORMATICS;

EID: 84885956452     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.11.018     Document Type: Article

References (35)

1. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro TTT plots: a perl program to create time-to-target plots Optimization Letters 1 2007 355 366 (Pubitemid 47519609)
2. V. Bafna, B.V. Halldorsson, R. Schwartz, A.G. Clark, and S. Istrail Haplotypes and informative SNP selection algorithms: do not block out information Proceedings of the 7th annual international conference on research in computational molecular biology 2003 ACM Berlin 19 27
3. J.E. Beasley An algorithm for set-covering problems European Journal of Operational Research 31 1987 85 93
4. J.E. Beasley OR-Library: distributing test problems by electronic mail Journal of the Operational Research Society 41 1990 1069 1072
5. J.E. Beasley A Lagrangian heuristic for set-covering problems Naval Research Logistics 37 1990 151 164
6. J.E. Beasley Lagrangean relaxation C.R. Reeves, Modern heuristic techniques for combinatorial problems 1993 Blackwell Scientific Publications Oxford 243 303
7. A. Caprara, P. Toth, and M. Fischetti A heuristic method for the set covering problem Operations Research 47 1999 730 743 (Pubitemid 30544593)
8. C.J. Chang, Y. Huang, and K.M. Chao A greedier approach for finding tag SNPs Bioinformatics 22 2006 685 691
9. V. Chvatal A greedy heuristic for the set-covering problem Mathematics of Operations Research 4 1979 233 235
10. T.A. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters 8 1989 67 71
11. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 6 1995 109 133
12. P. Festa, and M.G.C. Resende An annotated bibliography of GRASP, Part I: Algorithms International Transactions in Operational Research 16 2009 1 24
13. P. Festa, and M.G.C. Resende An annotated bibliography of GRASP, Part II: Applications International Transactions in Operational Research 16 2009 131 172
14. P. Festa, and M.G.C. Resende GRASP: an annotated bibliography C.C. Ribeiro, P. Hansen, Essays and surveys in metaheuristics 2002 Kluwer Academic Publishers Boston 325 367
15. M.L. Fisher The Lagrangian relaxation method for solving integer programming problems Management Science 50 2004 1861 1871
16. F. Glover Tabu search and adaptive memory programming - advances, applications and challenges R.S. Barr, R.V. Helgason, J.L. Kennington, Interfaces in computer science and operations research 1996 Kluwer Academic Publishers Boston 1 75
17. D.J. Gonsalvez, N.G. Hall, W.T. Rhee, and S.P. Siferd Heuristic solutions and confidence intervals for the multicovering problem European Journal of Operational Research 31 1987 94 101
18. Hall NG, Hochbaum DS. The multicovering problem: the use of heuristics, cutting planes, and subgradient optimization for a class of integer programs. Technical report, U.C. Berkeley; 1983.
19. N.G. Hall, and D.S. Hochbaum The multicovering problem European Journal of Operational Research 62 1992 323 339
20. M. Held, and R.M. Karp The traveling-salesman problem and minimum spanning trees Operations Research 18 1970 1138 1162
21. M. Held, and R.M. Karp The traveling-salesman problem and minimum spanning trees: Part II Mathematical Programming 1 1971 6 25
22. M. Held, P. Wolfe, and H.P. Crowder Validation of subgradient optimization Mathematical Programming 6 1974 62 88
23. Y. Huang, K. Zhang, T. Chen, and K.M. Chao Selecting additional tag SNPs for tolerating missing data in genotyping BMC Bioinformatics 6 2005 263 278
24. D.S. Johnson Approximation algorithms for combinatorial problems Journal of Computer and System Sciences 9 1974 256 278
25. M. Laguna, and R. Martí GRASP and path relinking for 2-layer straight line crossing minimization INFORMS Journal on Computing 11 1999 44 52
26. Pessoa LS. Heurísticas para o problema de k-cobertura de conjuntos. PhD thesis, Universidade Federal Fluminense, Niterói, RJ, Brazil; 2009 〈 http://www.ic.uff.br/PosGraduacao/Teses/439.pdf 〉.
27. Pessoa LS, Ribeiro CC. A GRASP for the minimum informative subset problem. In: Abstracts Book of the 7th metaheuristics international conference, Montréal; 2007. p. 44.
28. M. Prais, and C.C. Ribeiro Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment INFORMS Journal on Computing 12 2000 164 176
29. M.G.C. Resende An optimizer in the telecommunications industry SIAM SIAG/Optimization Views-and-News 18 2 2007 8 19
30. Resende MGC. Metaheuristic hybridization with greedy randomized adaptive search procedures. In: Chen Z-L, Raghavan S. editors. Tutorials in operations research, INFORMS, 2008. p. 295-319.
31. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures F. Glover, G. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers 219 249
32. M.G.C. Resende, and C.C. Ribeiro GRASP with path-relinking: recent advances and applications T. Ibaraki, K. Nonobe, M. Yagiura, Metaheuristics: progress as real problem solvers 2005 Springer-Verlag 29 63
33. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures: advances and applications M. Gendreau, J.-Y. Potvin, Handbook of metaheuristics, 2nd ed. 2010 Springer 293 319
34. M.G.C. Resende, C.C. Ribeiro, R. Martí, and F. Glover Scatter search and path-relinking: fundamentals, advances, and applications M. Gendreau, J.-Y. Potvin, Handbook of metaheuristics, 2nd ed. 2010 Springer 87 107
35. V.V. Vazirani Approximation algorithms 2004 Springer-Verlag Berlin