A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Discrete Applied Mathematics

Volumn 157, Issue 6, 2009, Pages 1198-1217

  da Cunha, Alexandre Salles ^a   Lucena, Abilio ^b   Maculan, Nelson ^b   Resende, Mauricio G C ^c  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Lagrangian relaxation; Non delayed relax and cut; Prize collecting Steiner problem in graphs

Indexed keywords

CONTROL THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEARIZATION;

DUAL BOUNDS; DUALITY GAPS; EFFECTIVE LAGRANGIAN; ISOLATED VERTICES; LAGRANGIAN; LAGRANGIAN HEURISTIC; LAGRANGIAN RELAXATION; LINEAR PROGRAMMING RELAXATIONS; LOWER BOUNDS; NON DELAYED RELAX-AND-CUT; PRIZE-COLLECTING STEINER PROBLEM IN GRAPHS; UNDIRECTED GRAPHS;

TREES (MATHEMATICS);

EID: 61549126601     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.02.014     Document Type: Article

References (28)

1. Balas E. The prize collecting traveling salesman problem. Networks 19 (1989) 621-636
2. J.E. Beasley, OR-Library: Operations Research Library. http://people.brunel.ac.uk/~mastjjb/jeb/info.html
3. Beasley J.E. An algorithm for the Steiner problem in graphs. Networks 14 (1984) 147-160
4. Beasley J.E. Lagrangean Relaxation. In: Reeves C. (Ed). Modern Heuristic Techniques (1993), Blackwell Scientific Press, Oxford
5. Bienstock D., Goemans M., Simchi-Levi D., and Williamson D.P. A note on the prize collecting travelling Salesman problem. Mathematical Programming 59 (1993) 413-420
6. Canuto S.A., Resende M.G.C., and Ribeiro C.C. Local search with perturbations for the prize collecting Steiner tree problem in graphs. Networks 38 (2001) 50-58
7. A.S. Cunha, A. Lucena, N. Maculan, M.G.C Resende, A relax-and-cut algorithm for the prize collecing Steiner problem in graphs. in: Mathematical Programming in Rio: A conference in honour of Nelson Maculan, pp. 72-78, Buzios, Rio de Janeiro, November 9-12, 2003
8. Cunha A.S., and Lucena A. Lower and upper bounds for the degree-constrained minimal spanning tree problem. Networks 50 (2007) 55-66
9. Dantzig G.B., Fulkerson R., and Johnson S. Solution of a large scale traveling salesman problem. Operations Research 2 (1954) 393-410
10. C. Duin, Steiner's problem in graphs: Approximation, reduction, variation, Ph. D. Thesis, University of Amsterdam, 1994
11. Duin C., and Voss S. Efficient path and vertex exchange in Steiner tree algorithms. Networks 29 (1997) 89-105
12. Goemans M., and Williamson D.P. The primal dual method for approximation algorithms and its applications to network design problems. In: Houchbaum D.S. (Ed). Approximation algorithms for NP-hard problems (1996), P.W.S Publishing Co 144-191
13. Hakimi S.L. Steiner's problem in graphs. Networks 1 (1971) 113-133
14. Haouari M., and Siala J.C. A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Computers and Operations Research 33 (2006) 1274-1288
15. D.S. Johnson, M. Minkoff, S. Phillips, The prize collecting Steiner tree problem: Theory and Practice, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000
16. Karp R.M. Reductibility among combinatorial problems. In: Miller E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
17. Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
18. I. Ljubic, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, M. Fischetti, Solving the Prize-Collecting Steiner Problem to Optimality, Technical report, Technische Universitat Wien, Institut fur Computergraphik und Algorithmen, 2004
19. Lucena A. Steiner problem in graphs: lagrangean relaxation and cutting planes. COAL Bulletin 21 (1992) 2-8
20. A. Lucena, Tight bounds for the Steiner problem in graphs, Technical Report TR- 21/93., Dipartimento di Informatica. Univesitat degli Studi di Pisa, Pisa, Italy, 1993
21. Lucena A. Non delayed relax-and-cut algorithms. Annals of Operations Research 140 (2005) 375-410
22. Lucena A., and Resende M.G.C. Strong lower bounds for the prize-collecting Steiner problem in Graphs. Discrete Applied Mathematics 141 (2004) 277-294
23. M. Minkoff, The prize collecting Steiner tree problem, Master's thesis, Departament of Electrical Engineering and Computer Science, Massachusetts Insitute of Technology, 2000
24. Ribeiro C.C., and deSouza M.C. Tabu search for the Steiner problem in graphs. Networks 36 2 (2000) 138-146
25. I. Rosseti, M. Poggi de Aragão, C.C. Ribeiro, E. Uchoa, R.F. Werneck, New benchmark instances for the Steiner problem in graphs, in: Extended Abstracts of the 4th Metaheuristics International Conference, 2001, pp. 557-561
26. Savelsbergh M., and Volgenant A. Edge exchanges in the degree constrained minimum spanning tree problem. Computers and Operations Research 12 4 (1985) 341-348
27. Segev A. The Node-Weighted Steiner Tree Problem. Networks 17 (1987) 1-17
28. Volgenant A., and Jonker R. The symmetric traveling salesman problem and edge exchanges in minimal 1-trees. European Journal of Operational Research 12 (1983) 394-403