Reduction tests for the prize-collecting Steiner problem

Operations Research Letters

Volumn 34, Issue 4, 2006, Pages 437-444

  Uchoa, Eduardo ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Combinatorial optimization; Network design; Preprocessing; Steiner problem

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; NONLINEAR EQUATIONS; PROBLEM SOLVING; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION; NETWORK DESIGN; PREPROCESSING; STEINER PROBLEMS;

OPERATIONS RESEARCH;

EID: 33746587016     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.02.007     Document Type: Article

References (19)

1. Balakrishnan A., and Patel N. Problem reduction methods and a tree generation algorithm for the Steiner network problems. Networks 17 (1987) 65-85
2. Beasley J. An algorithm for the Steiner problem in graphs. Networks 14 (1984) 147-159
3. Canuto S., Resende M., and Ribeiro C.C. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38 (2001) 50-58
4. C. Duin, Steiner's problem in graphs, Ph.D. Thesis, University of Amsterdam, 1993.
5. Duin C., and Volgenant A. Reduction tests for the Steiner problem in graphs. Networks 19 (1989) 549-567
6. Johnson D., Minkoff M., and Phillips S. The prize-collecting Steiner tree problem. theory and practice. Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms Conference. San Francisco (2000) 760-769
7. G. Klau, I. Ljubić, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, R. Weiskircher, Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem, Proceedings of the GECCO-2004, Lecture Notes in Comput. Sci., vol. 3102, Springer, Berlin, 2004, pp. 1304-1315.
8. Koch T., and Martin A. Solving Steiner tree problems in graphs to optimality. Networks 32 (1998) 207-232
9. T. Koch, A. Martin, S. Voss, SteinLib: an updated library on Steiner tree problems in graphs, Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB-Report 00-37, 2000 (online document at http://elib.zib.de/steinlib).
10. I. Ljubić, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, M. Fischetti, Solving the prize-collecting Steiner tree problem to optimality, TR-186-1-04-01, Technische Universität Wien, October 2004, Math. Programing, in press.
11. Lucena A., and Resende M. Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl. Math. 141 (2004) 277-294
12. Poggi de Aragão M., Uchoa E., and Werneck R.F. Dual heuristics on the exact solution of large Steiner problems. Electron. Notes Discrete Math. 7 (2001)
13. T. Polzin, Algorithms for the Steiner problem in networks, Ph.D. Thesis, Universität des Saarlandes, 2003.
14. Polzin T., and Vahdati S. Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112 (2001) 263-300
15. Polzin T., and Vahdati S. Extending reduction techniques for the Steiner tree problem. Proceedings of the ESA 2002 (2002) 795-807
16. E. Uchoa, Algoritmos para problemas de Steiner com aplicação em projeto de circuitos VLSI, Ph.D. Thesis, Pontifícia Universidade Católica do Rio de Janeiro, 2001.
17. Uchoa E., Poggi de Aragão M., and Ribeiro C.C. Preprocessing Steiner problems from VLSI layout. Networks 40 (2002) 38-50
18. Voss S. A reduction based algorithm for the Steiner problem in graphs. Methods Oper. Res. 58 (1989) 239-252
19. R.F. Werneck, Problema de Steiner em grafos: algoritmos primais, duais e exatos, Master's Thesis, Pontifícia Universidade Católica do Rio de Janeiro, 2001.