Strong lower bounds for the prize collecting Steiner problem in graphs

In this paper, we present an integer programming formulation of the prize collecting Steiner problem in graphs (PCSPG) and describe an algorithm to obtain lower bounds for the problem. The algorithm is based on polyhedral cutting planes and is initiated with tests that attempt to reduce the size of the input graph. Computational experiments were carried out to evaluate the strength of the formulation through its linear programming relaxation. On 96 out of the 114 instances tested, integer solutions were found (thus generating optimal PCSPG solutions).

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

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

[4]  T. Koch,et al.  Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[5]  Thomas M. Liebling,et al.  Tree polytope on 2-trees , 1994, Math. Program..

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

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

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

[9]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[10]  John E. Beasley.  Advances in Linear and Integer Programming , 1996 .

[11]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

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

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

[14]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[15]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .

[16]  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.

[17]  H. Donald Ratliff,et al.  A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..

[18]  Abilio Lucena,et al.  Branch and cut algorithms , 1996 .