Skip to main content
SpringerLink
Log in

The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We propose a generalized version of the Prize Collecting Steiner Tree Problem (PCSTP), which offers a fundamental unifying model for several well-known \(\mathcal{NP}\) -hard tree optimization problems. The PCSTP also arises naturally in a variety of network design applications including cable television and local access networks. We reformulate the PCSTP as a minimum spanning tree problem with additional packing and knapsack constraints and we explore various nondifferentiable optimization algorithms for solving its Lagrangian dual. We report computational results for nine variants of deflected subgradient strategies, the volume algorithm (VA), and the variable target value method used in conjunction with the VA and with a generalized Polyak–Kelley cutting plane technique. The performance of these approaches is also compared with an exact stabilized constraint generation procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)

    Google Scholar 

  2. Bahiense, L., Barahona, F., Porto, O.: Solving Steiner tree problems in graphs with Lagrangian relaxation. J. Comb. Optim. 7, 259–282 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bahiense, L., Maculan, N., Sagastizábal, C.: The volume algorithm revisited: relation with bundle methods. Math. Program. 94, 41–69 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Balas, E.: The prize-collecting traveling salesman problem. Networks 19, 621–636 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385–399 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Beasley, J.E.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1–16 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)

    Article  MathSciNet  Google Scholar 

  8. Blum, C., Blesa, M.J.: New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput. Oper. Res. 32, 1355–1377 (2005)

    Article  Google Scholar 

  9. Blum, C., Ehrgott, M.: Local search algorithms for the k-cardinality tree problem. Discrete Appl. Math. 128, 511–540 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Borndörfer, R., Fereira, C., Martin, A.: Decomposing matrices into blocks. SIAM J. Optim. 9, 236–269 (1998)

    Article  MATH  Google Scholar 

  11. Camerini, P.M., Frata, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. Math. Program. Study 3, 26–34 (1975)

    Google Scholar 

  12. Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50–58 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Crowder, H.: Computational improvements for subgradient optimization. In: Symposia Mathematica, vol. XIX, pp. 357–372. Academic Press, London (1976)

    Google Scholar 

  14. Du, D.Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner tree problems. Encycl. Optim. 5, 227–290 (2001)

    Google Scholar 

  15. Duin, C.W., Volgenant, A., Voß, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154, 323–329 (2004)

    Article  MATH  Google Scholar 

  16. Ehrgott, M., Freitag, J.: k-tree/k-subgraph: a program package for minimal weighted k-cardinality trees and subgraphs. Eur. J. Oper. Res. 93, 224–225 (1996)

    Article  MATH  Google Scholar 

  17. Feremans, C., Labbé, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39, 29–34 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  18. Fischetti, M., Hamacher, H.W., Jörnsten, K., Maffioli, F.: Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24, 11–21 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  19. Foulds, L.R., Hamacher, H.W., Wilson, J.: Integer programming approaches to facilities models with forbidden areas. Ann. Oper. Res. 81, 405–417 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Garg, N., Hochbaum, D.: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica 18, 111–121 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  21. Geoffrion, A.: Lagrangian relaxation and its uses in integer programming. Math. Program. Study 2, 82–114 (1974)

    MathSciNet  Google Scholar 

  22. Goemans, M.X., Williamson, D.P.: The primal–dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 144–191. PWS, Boston (1997)

    Google Scholar 

  23. Goffin, J.L.: On convergence rates of subgradient optimization methods. Math. Program. 13, 329–347 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  24. Guignard, M., Kim, S.: Lagrangian decomposition: a model yielding stronger Lagrangian bounds. Math. Program. 39, 215–228 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  25. Haouari, M., Chaouachi, J.: Lower and upper bounding strategies for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 171, 632–647 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  26. Haouari, M., Chaouachi, J.: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Comput. Oper. Res. 33, 1274–1288 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  27. Haouari, M., Chaouachi, J., Dror, M.: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J. Oper. Res. Soc. 56, 382–389 (2005)

    Article  MATH  Google Scholar 

  28. Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6, 62–88 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  29. Helvig, C.S., Robins, G., Zelikovsky, A.: An improved approximation scheme for the group Steiner problem. Networks 37, 820 (2001)

    Article  MathSciNet  Google Scholar 

  30. Hiriart-Urruty, J.B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)

    Google Scholar 

  31. Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22, 55–89 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  32. Ihler, E., Reich, G., Widmayer, P.: Class Steiner trees and VLSI-design. Discrete Appl. Math. 90, 173–194 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  33. Ikura, Y., Nemhauser, G.L.: An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs. Ann. Discrete Math. 16, 149–168 (1982)

    MATH  MathSciNet  Google Scholar 

  34. Johnson, D.S., Minkoff, M., Philips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th ACM–SIAM Symposium on Discrete Mathematics, San Fransisco, CA, pp. 760–769 (2000)

  35. Jörnsten, K., Lokketangen, A.: Tabu search for weighted k-cardinality trees. Asia-Pac. J. Oper. Res. 14, 9–26 (1997)

    MATH  Google Scholar 

  36. Jünger, M., Reinelt, G., Rinaldi, G.: The travelling salesman problem. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operational Research and Management Science, vol. 7, pp. 225–330. North-Holland, Amsterdam (1995)

    Google Scholar 

  37. Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33, 1464–1487 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  38. Kappel, F., Kuntsevich, A.V.: An implementation of Shor’s r-algorithm. Comput. Optim. Appl. 15, 193–205 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  39. Kataoka, S., Araki, N.: Upper and lower bounding procedures for minimum rooted k-subtree problem. Eur. J. Oper. Res. 122, 561–569 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  40. Kelley, J.E.: The cutting-plane method for solving convex programs. J. SIAM 8, 703–712 (1960)

    MathSciNet  Google Scholar 

  41. Lemaréchal, C., Bundle method in nonsmooth optimization. In: Lemaréchal, C., Mifflin, R. (eds.) Nonsmooth Optimization: Proceedings of IIASA Workshop, pp. 79–109 (1978)

  42. Lemaréchal, C., Sagastizabal, C.: Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76, 393–410 (1997)

    Article  Google Scholar 

  43. Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Program. 105, 427–449 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  44. Lucena, A., Resende, M.G.C.: Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl. Math. 141, 277–294 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  45. Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Handbooks in Operational Research and Management Science, vol. 7, pp. 503–615. North-Holland, Amsterdam (1995)

    Google Scholar 

  46. Marsten, R.E., Hogan, W.W., Blankenship, J.W.: The BOXSTEP method for large-scale optimization. Oper. Res. 23, 389–405 (1975)

    MATH  MathSciNet  Google Scholar 

  47. Mifflin, R.: An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2, 191–207 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  48. Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26, 231–241 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  49. Polyak, B.T.: A general method of solving extremum problems. Sov. Math. Dokl. 8, 593–597 (1967)

    MATH  Google Scholar 

  50. Polyak, B.T.: Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. 9, 14–29 (1969)

    Article  Google Scholar 

  51. Reich, G., Widmayer, P.: Beyond Steiner’s problem: a VLSI oriented generalization. In: Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, WG’89. Lecture Notes in Computer Science, vol. 411, pp. 196–210. Springer, Berlin (1990)

    Google Scholar 

  52. Salazar, J.J.: A note on the generalized Steiner tree polytope. Discrete Appl. Math. 100, 137–144 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  53. Segev, A.: The node-weighted Steiner tree problem. Networks 17, 1–17 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  54. Sherali, H.D., Choi, G., Ansari, Z.: Limited memory space dilatation and reduction algorithms. Comput. Optim. Appl. 19, 55–77 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  55. Sherali, H.D., Choi, G., Tuncbilek, C.H.: A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26, 1–8 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  56. Sherali, H.D., Ulular, O.: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20, 193–221 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  57. Sherali, H.D., Ulular, O.: Conjugate gradient methods using quasi-Newton updates with inexact line searches. J. Math. Anal. Appl. 150, 359–377 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  58. Shor, N.Z.: Utilization of the operation of space dilatation in the minimization of convex functions. Kibernetika 1, 6–12 (1970)

    Google Scholar 

  59. Shor, N.Z.: Convergence rate of the gradient descent method with dilatation of the space. Kibernetika 2, 80–85 (1970)

    Google Scholar 

  60. Shor, N.Z.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)

    Google Scholar 

  61. Shor, N.Z., Shabashova, L.P.: Solution of minimax problems by the method of generalized gradient descent with dilatation of the space. Kibernetika 1, 82–88 (1972)

    Google Scholar 

  62. Shor, N.Z., Zhurbenko, N.G.: A minimization method using the operation of space dilatation in the direction of the difference of two successive gradients. Kibernetika 3, 51–59 (1971)

    Google Scholar 

  63. Yang, B., Gillard, P.: The class Steiner minimal tree problem: a lower bound and test problem generation. Acta Informatica 37, 193–211 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Combinatorial Optimization Research Group, ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia

    Mohamed Haouari & Safa Bhar Layeb

  2. Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Hanif D. Sherali

Authors
  1. Mohamed Haouari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Safa Bhar Layeb
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Haouari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haouari, M., Layeb, S.B. & Sherali, H.D. The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches. Comput Optim Appl 40, 13–39 (2008). https://doi.org/10.1007/s10589-007-9072-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9072-6

Keywords

Search

Navigation