An exact algorithm for the node weighted Steiner tree problem

4OR

Volumn 4, Issue 2, 2006, Pages 124-144

  Cordone, Roberto ^a   Trubian, Marco ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Prize collecting; Relax and cut; Steiner problem

Indexed keywords

EID: 33746044221     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0081-y     Document Type: Article

References (21)

1. Beasley JE (1989) An SST-based algorithm for the Steiner problem in graphs. Networks 19: 1-16
2. Bienstock D, Goemans MX, SimchiLevi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Mathematical Programming 59: 413-420
3. Camerini PM, Fratta L, Maffioli F (1975) On improving relaxation methods by modified gradient techniques. Mathematical Programming Study 3: 26-34
4. Canuto SA, Resende MGC, Ribeiro CC (2001) Local search with perturbations for the prize collecting Steiner tree problem in graphs. Networks 38: 50-58
5. Chopra S, Gorres ER (1990) On the node weighted Steiner tree problem. Department of Managerial Economics and Decision Sciences, J. L. Kellogg Graduate School of Management, Northwestern University, Evanston, IL
6. Cordone R, Trubian M (2005) A tabu search heuristic for the node weighted Steiner tree problem. Manuscript
7. Duin CW, Volgenant A (1987) Some generalizations of the Steiner problem in graphs. Networks 17: 353-364
8. Engevall S, Göthe-Lundgren M, Värbrand P (1998) A strong lower bound for the node weighted Steiner tree problem. Networks 31: 11-17
9. Feofiloff P, Fernandes CG, Ferreira CE, Pina JC (2003) Primal-dual approximation algorithms for the prize-collecting Steiner tree problem. (Submitted)
10. Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM Journal on Computing 24(2): 296-317
11. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research 13: 462-475
12. Held M, Karp RM (1970) The travelling-salesman problem and minimum spanning trees. Operations Research 18:1138-1162
13. Johnson DS, Minkoff M, Phillips S (2000) The prize collecting tree problem: Theory and practice. Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms: 760-769
14. Klau GW, Ljubic I, Moser A, Mutzel P, Neuner P, Pferschy U, Raidl G, Weiskircher R (2004) Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. GECCO2004: Genetic and Evolutionary Computation Conference, vol 3102, LNCS, pp 1304-1315. Springer, Berlin Heidelberg New York
15. Klein P, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 19(1): 104-115
16. Ljubik I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2005) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming (to appear)
17. Lucena A (1992) Steiner problem in graphs: Lagrangean relaxation and cuttingplanes. COAL Bulletin 21:2-8
18. Lucena A, Resende MGC (2004) Strong lower bounds for the prize collecting steiner problem in graphs. Discrete Applied Mathematics 141: 277-294
19. LucenaA, Resende MGC (2000) Strong lower bounds for the prize collecting Steiner problem in graphs. Technical Report 00.3.1, AT&T Labs
20. Magnanti TL, Wolsey LA 81995) Optimal trees. In: Network models. Handbooks in Operations Research and Management Science, Ch 9, pp 503-615. North-Holland
21. Segev A (1987) The node-weighted Steiner tree problem. Networks 17: 1-17