A parallel GRASP heuristic for the 2-path network design problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2400, Issue , 2002, Pages 922-926

  Ribeiro, Celso C ^a   Rosseti, Isabel ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL RESULTS; LINEAR SPEED-UP; NETWORK DESIGN PROBLEMS; PARALLEL IMPLEMENTATIONS; PARALLEL STRATEGIES; PATH RELINKING;

ARTIFICIAL INTELLIGENCE;

EID: 84956870039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_131     Document Type: Conference Paper

References (11)

1. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro, “Local search with perturbations for the prize-collecting Steiner tree problem in graphs”, Networks 38 (2001), 50–58.
2. V.D. Cung, S.L. Martins, C.C. Ribeiro, and C. Roucairol, “Strategies for the parallel implementation of metaheuristics”, in Essays and Surveys in Metaheuristics (C.C. Ribeiro and P. Hansen, eds.), pages 263–308, Kluwer, 2001.
3. G. Dahl and B. Johannessen, “The 2-path network design problem”, submitted for publication, 2000.
4. T.A. Feo and M.C.G. Resende, “Greedy randomized adaptive search procedures”, Journal of Global Optimization 6 (1995), 109–133.
5. F. Glover, “Tabu search and adaptive memory programing – Advances, applications and challenges”, in Interfaces in Computer Science and Operations Research (R.S. Barr, R.V. Helgason, and J.L. Kennington, eds.), pages 1–75, Kluwer, 1996.
6. R. Jain, The art of Computer Systems Performance Analysis: Techniques for Experimental Desgin, Measurement, Simulation, and Modeling, Wiley, 1991.
7. M. Laguna and R. Martí, “GRASP and path relinking for 2-layer straight line crossing minimization”, INFORMS Journal on Computing 11 (1999), 44–52.
8. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P. Pardalos, “A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy”, Journal of Global Optimization 17 (2000), 267–283.
9. S.L. Martins, C.C. Ribeiro, and M.C. Souza, “A parallel GRASP for the Steiner problem in graphs”, Lecture Notes in Computer Science 1457 (1998), 285–297.
10. M.G.C. Resende and C.C. Ribeiro, “GRASP”, to appear in State-of-the-Art Handbook of Metaheuristics (F. Glover and G. Kochenberger, eds.), Kluwer.
11. C.C. Ribeiro, E. Uchoa, and R.F. Werneck, “A hybrid GRASP with perturbations for the Steiner problem in graphs”, to appear in INFORMS Journal on Computing.