Mathematical Programming

, Volume 105, Issue 2, pp 427-449

First online:

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

  • Ivana LjubićAffiliated withVienna University of Technology Email author 
  • , René WeiskircherAffiliated withVienna University of Technology
  • , Ulrich PferschyAffiliated withUniversity of Graz
  • , Gunnar W. KlauAffiliated withVienna University of Technology
  • , Petra MutzelAffiliated withVienna University of Technology
  • , Matteo FischettiAffiliated withDEI, University of Padova

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 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 branch-and-cut algorithm based on a directed graph model where we combine several state-of-the-art 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 large-scale real-world instances arising in the design of fiber optic networks, we also obtain optimal solution values.


Branch-and-Cut Steiner Arborescence Prize Collecting Network Design