Local search with perturbations for the prize-collecting Steiner tree problem in graphs

Networks

Volumn 38, Issue 1, 2001, Pages 50-58

  Canuto, S A ^a   Resende, M G C ^b   Ribeiro, C C ^a  

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

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Graphs; Local search; Network design; Path relinking; Prize collecting; Steiner problem; Variable neighborhood search

Indexed keywords

EID: 0035633186     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.1023     Document Type: Article

References (16)

1. [1] J.E. Beasley, OR-Library: Distributing test problems by electronic mail, J Oper Res Soc 41 (1990), 1069-1072.
2. [2] I. Charon and O. Hudry, The noising method: A new method for combinatorial optimization, Oper Res Lett 14 (1993), 133-137.
3. [3] S. Engevall, M. Göthe-Lundgren, and P. Värbrand, A strong lower bound for the node weighted Steiner tree problem, Networks 31 (1998), 11-17.
4. [4] T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, J Global Optim 6 (1995), 109-133.
5. [5] F. Glover, Tabu search and adaptive memory programming - Advances, applications and challenges, Interfaces in Computer Science and Operations Research, R.S. Barr, R. Helgason, and J. Kennington (Editors), Kluwer, 1996, pp. 1-75.
6. [6] F. Glover and M. Laguna, Tabu search, Kluwer, 1997.
7. [7] M.X. Goemans and D.P. Williamson, "The primal dual method for approximation algorithms and its application to network design problems," Approximation algorithms for NP-hard problems, D. Hochbaum (Editor), PWS, 1996, pp. 144-191.
8. [8] D.S. Johnson, M. Minkoff, and S. Phillips, The prize collecting Steiner tree problem: Theory and practice, Proc 11th ACM-SIAM Symp on Discrete Algorithms, 2000, pp. 760-769.
9. [9] R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, E. Miller and J.W. Thatcher (Editors), Plenum, 1972, pp. 85-103.
10. [10] J.B. Kruskal, On the shortest spanning tree of a graph and the traveling salesman problem, Proc American Mathematical Society, 1956, Vol. 7, pp. 48-50.
11. [11] M. Laguna and R. Martí, GRASP and path relinking for 2-layer straight line crossing minimization, INFORMS J Comput 11 (1999), 44-52.
12. [12] A. Lucena and M.G.C. Resende, Strong lower bounds for the prize-collecting Steiner tree problem, Technical report, AT&T Labs Research, 1999.
13. [13] N. Mladenović and P. Hansen, Variable neighbourhood search, Comput Oper Res 24 (1997), 1097-1100.
14. [14] M. Riepe, elf_hash, 1996, http://src.openresources.com/ debian/src/libs/HTML/index.html, online document last visited on February 20, 2001.
15. [15] L. Schrage, A more portable Fortran random number generator, ACM Trans Math Software 5 (1979), 132-138.
16. [16] A. Segev, The node-weighted Steiner tree problem, Networks 17 (1987), 1-17.