Solving the Prize-Collecting Steiner Tree Problem to Optimality

  title={Solving the Prize-Collecting Steiner Tree Problem to Optimality},
  author={Ivana Ljubic and Ren{\'e} Weiskircher and Ulrich Pferschy and Gunnar W. Klau and Petra Mutzel and Matteo Fischetti},
The Prize-Collecting 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 in the design of utility networks (eg. fiber optics or district heating) where profit generating customers and the network connecting them have to be chosen in the most profitable way. The primary focus of this paper is the construction of… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 27 extracted citations


Publications referenced by this paper.
Showing 1-10 of 30 references

Lucena and M . G . C . Resende . Strong lower bounds for the prize - collecting Steiner problem in graphs

  • A. Prodon Margot, Th. M. Liebling
  • Discrete Applied Mathematics
  • 2004

Simulation and optimization of the implementation costs for the last mile of fiber optic networks

  • M. Prossegger Bachhiesl, G. Paulus, J. Werner, H. Stögner
  • Networks and Spatial Economics
  • 2003

Similar Papers

Loading similar papers…