Abstract
We introduce the prize-collecting generalized minimum spanning tree problem. In this problem a network of node clusters needs to be connected via a tree architecture using exactly one node per cluster. Nodes in each cluster compete by offering a payment for selection. This problem is NP-hard, and we describe several heuristic strategies, including local search and a genetic algorithm. Further, we present a simple and computationally efficient branch-and-cut algorithm. Our computational study indicates that our branch-and-cut algorithm finds optimal solutions for networks with up to 200 nodes within two hours of CPU time, while the heuristic search procedures rapidly find near-optimal solutions for all of the test instances.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)
Cockayne, E.J., Melzak, Z.A.: Steiner’s problem for set terminals. Q. Appl. Math. 26(2), 213–218 (1968)
Dror, M., Haouari, M., Chaouachi, J.: Generalized spanning trees. Eur. J. Oper. Res. 120(3), 583–592 (2000)
Duin, C.: Steiner problem in graphs: approximation, reduction, variation. Ph.D. thesis, University of Amsterdam (1993)
Duin, C., Voß, S.: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3), 181–191 (1999)
Duin, C., Voß, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1), 323–329 (2004)
Feremans, C.: Generalized spanning trees and extensions. Ph.D. thesis, Université Libre de Bruxelles (2001)
Feremans, C., Labbé, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1), 29–34 (2002)
Feremans, C., Labbé, M., Laporte, G.: The generalized minimum spanning tree problem: polyhedral analysis and branch-and-cut algorithm. Networks 43(2), 71–86 (2004)
Fischetti, M., Salazar-Gonzalez, J.J., Toth, P.: Symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997)
Golden, B., Raghavan, S., Stanojević, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS J. Comput. 17(3), 290–304 (2005)
Haouari, M., Chaouachi, J., Dror, M.: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J. Oper. Res. Soc. 56(4), 382–389 (2005)
Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. North-Holland, Amsterdam (1995)
Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119–128 (1991)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1996)
Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26(4), 231–241 (1995)
Pop, P.C.: New models of the generalized minimum spanning tree problem. J. Math. Model. Algorithms 3(2), 153–166 (2004)
Pop, P.C., Kern, W., Still, G.: A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3), 900–908 (2006)
Shyu, S.J., Yin, P.Y., Lin, B.M.T., Haouari, M.: Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J. Exp. Theor. Artif. Intell. 15(1), 103–112 (2003)
Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585–591 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Golden, B., Raghavan, S. & Stanojević, D. The prize-collecting generalized minimum spanning tree problem. J Heuristics 14, 69–93 (2008). https://doi.org/10.1007/s10732-007-9027-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-007-9027-1