An Algorithmic Framework for the Exact Solution of the PrizeCollecting Steiner Tree Problem
 Ivana Ljubić,
 René Weiskircher,
 Ulrich Pferschy,
 Gunnar W. Klau,
 Petra Mutzel,
 Matteo Fischetti
 … show all 6 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The PrizeCollecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total profit of all vertices not contained in the subtree. PCST appears frequently in the design of utility networks where profit generating customers and the network connecting them have to be chosen in the most profitable way.
Our main contribution is the formulation and implementation of a branchandcut algorithm based on a directed graph model where we combine several stateoftheart methods previously used for the Steiner tree problem. Our method outperforms the previously published results on the standard benchmark set of problems.
We can solve all benchmark instances from the literature to optimality, including some of them for which the optimum was not known. Compared to a recent algorithm by Lucena and Resende, our new method is faster by more than two orders of magnitude. We also introduce a new class of more challenging instances and present computational results for them. Finally, for a set of largescale realworld instances arising in the design of fiber optic networks, we also obtain optimal solution values.
 Aneja, Y.P.: An integer linear programming approach to the Steiner problem in graphs. Networks 10, 167–178 (1980)
 Bachhiesl, P., Prossegger, M., Paulus, G., Werner, J., Stögner, H.: Simulation and optimization of the implementation costs for the last mile of fiber optic networks. Networks and Spatial Economics 3 (4), 467–482 (2003)
 Beasley, J.E.: An SSTbased algorithm for the Steiner problem in graphs. Networks 19, 1–16 (1989)
 Bienstock, D., Goemans, M.X., SimchiLevi, D., Williamson, D.: A note on the prizecollecting traveling salesman problem. Mathematical Programming 59, 413–420 (1993) CrossRef
 Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prizecollecting Steiner tree problem in graphs. Networks 38, 50–58 (2001) CrossRef
 Cherkassky, B.V., Goldberg, A.V.: On implementing pushrelabel method for the maximum flow problem. Algorithmica 19, 390–410 (1997)
 Chopra, S., Gorres, E., Rao, M.R.: Solving a Steiner tree problem on a graph using a branch and cut. ORSA Journal on Computing, 4, 320–335 (1992)
 Chopra, S., Rao, M.R.: The Steiner tree problem I: Formulations, compositions and extension of facets. Mathematical Programming 64, 209–229 (1994)
 Dongarra, J.J.: Performance of various computers using standard linear equations software (linpack benchmark report). Technical Report CS8985, University of Tennessee, 2004
 Duin, C.W., Volgenant, A.: Some generalizations of the Steiner problem in graphs. Networks 17 (2), 353–364 (1987)
 Engevall, S., GötheLundgren, M., Värbrand, P.: A strong lower bound for the node weighted Steiner tree problem. Networks 31 (1), 11–17 (1998)
 Feofiloff, P., Fernandes, C.G., Ferreira, C.E., Pina, J.C.: Primaldual approximation algorithms for the prizecollecting Steiner tree problem. 2003 (submitted)
 Fischetti, M.: Facets of two Steiner arborescence polyhedra. Mathematical Programming 51, 401–419 (1991) CrossRef
 Goemans, M.X.: The Steiner tree polytope and related polyhedra. Mathematical Programming 63, 157–182 (1994) CrossRef
 Goemans, M.X., Williamson, D.P.: The primaldual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed) Approximation algorithms for NPhard problems, P. W. S. Publishing Co., 1996, pp 144–191
 Gutin, G., Punnen, A. (eds) The traveling salesman problem and its variations. Kluwer, 2002
 Hackner, J.: Energiewirtschaftlich optimale Ausbauplanung kommunaler Fernwärmesysteme. PhD thesis, Vienna University of Technology, Austria, 2004
 Johnson, D.S., Minkoff, M., Phillips, S.: The prizecollecting Steiner tree problem: Theory and practice. In: Proceedings of 11th ACMSIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp 760–769
 Klau, G.W., Ljubić, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Weiskircher, R.: Combining a memetic algorithm with integer programming to solve the prizecollecting Steiner tree problem. In: Deb, K. (ed), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2004), volume 3102 of LNCS, SpringerVerlag, 2004, pp 1304–1315
 Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks, 32, 207–232 (1998) CrossRef
 Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: Solving the prizecollecting Steiner tree problem to optimality. In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments (ALENEX 05). SIAM, 2005 (to appear)
 Lucena, A., Resende, M.G.C.: Strong lower bounds for the prizecollecting Steiner problem in graphs. Discrete Applied Mathematics 141, 277–294 (2004) CrossRef
 Minkoff, M.: The prizecollecting Steiner tree problem. Master's thesis, MIT, May, 2000
 Segev, A.: The nodeweighted Steiner tree problem. Networks 17, 1–17 (1987)
 Uchoa, E.: Reduction tests for the prizecollecting Steiner problem. Technical Report RPEP Vol.4 no.18, Universidade Federal Fluminense, Engenharia de Produção, Niterói, Brazil, 2004
 Wong, R.T.: A dual ascent based approach for the Steiner tree problem in directed graphs. Mathematical Programming 28, 271–287 (1984)
 Title
 An Algorithmic Framework for the Exact Solution of the PrizeCollecting Steiner Tree Problem
 Journal

Mathematical Programming
Volume 105, Issue 23 , pp 427449
 Cover Date
 20060201
 DOI
 10.1007/s101070050660x
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 BranchandCut
 Steiner Arborescence
 Prize Collecting
 Network Design
 Industry Sectors
 Authors

 Ivana Ljubić ^{(1)}
 René Weiskircher ^{(1)}
 Ulrich Pferschy ^{(2)}
 Gunnar W. Klau ^{(1)}
 Petra Mutzel ^{(1)}
 Matteo Fischetti ^{(3)}
 Author Affiliations

 1. Vienna University of Technology, Favoritenstr. 911, 1040, Vienna, Austria
 2. University of Graz, Universitätsstr. 15, 8010, Graz, Austria
 3. DEI, University of Padova, via Gradenigo 6/a, 35131, Padova, Italy