Algorithmic expedients for the Prize Collecting Steiner Tree Problem

This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as a preset quota, the PCSTP seeks to find a subtree that includes the root node and collects a total prize not smaller than the specified quota, while minimizing the sum of the total edge costs of the tree plus the penalties associated with the nodes that are not included in the subtree. For this challenging network design problem that arises in telecommunication settings, we present two valid 0-1 programming formulations and use them to develop preprocessing procedures for reducing the graph size. Also, we design an optimization-based heuristic that requires solving a PCSTP on a specific tree-subgraph. Although, this latter special case is shown to be NP-hard, it is effectively solvable in pseudo-polynomial time. The worst-case performance of the proposed heuristic is also investigated. In addition, we describe new valid inequalities for the PCSTP and embed all the aforementioned constructs in an exact row-generation approach. Our computational study reveals that the proposed approach can solve relatively large-scale PCSTP instances having up to 1000 nodes to optimality.

[1]  Hanif D. Sherali,et al.  The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches , 2008, Comput. Optim. Appl..

[2]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[3]  H. Joksch.  The shortest route problem with constraints , 1966 .

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  G. Nemhauser,et al.  An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs , 1982 .

[6]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[7]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[8]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[9]  Sunil Chopra,et al.  Polyhedral Approaches for the Steiner Tree Problem on Graphs , 2001 .

[10]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[11]  Petra Mutzel,et al.  The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract , 2003, ESA.

[12]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[13]  Siavash Vahdati Daneshmand,et al.  A comparison of Steiner tree relaxations , 2001, Discret. Appl. Math..

[14]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[15]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[16]  Matteo Fischetti,et al.  Facets of two Steiner arborescence polyhedra , 1991, Math. Program..

[17]  Alexandre Salles da Cunha,et al.  A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs , 2009, Discret. Appl. Math..

[18]  Mohamed Haouari,et al.  A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem , 2006, Comput. Oper. Res..

[19]  H. Sherali,et al.  Conjugate gradient methods using quasi-Newton updates with inexact line searches , 1990 .

[20]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[21]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[22]  A. Volgenant,et al.  Some generalizations of the steiner problem in graphs , 1987, Networks.

[23]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[24]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[25]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[26]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.