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

@article{Ljubic2006AnAF,
title={An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem},
author={Ivana Ljubic and Ren{\'e} Weiskircher and Ulrich Pferschy and Gunnar W. Klau and Petra Mutzel and Matteo Fischetti},
journal={Math. Program.},
year={2006},
volume={105},
pages={427-449}
}

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… CONTINUE READING