Abstract
We consider a generalization of the Minimum Spanning Tree Problem, called the Generalized Minimum Spanning Tree Problem, denoted by GMST. It is known that the GMST problem is NP-hard. We present a stronger result regarding its complexity, namely, the GMST problem is NP-hard even on trees as well an exact exponential time algorithm for the problem based on dynamic programming. We describe new mixed integer programming models of the GMST problem, mainly containing a polynomial number of constraints. We establish relationships between the polytopes corresponding to their linear relaxations. Based on a new model of the GMST we present a solution procedure that solves the problem to optimality for graphs with nodes up to 240. We discuss the advantages of our method in comparison with earlier methods.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cayley, A.: On the mathematical theory of isomers, Philos. Magazine 67 (1874), 444.
Dror, M., Haouari, M. and Chaouachi, J.: Generalized spanning trees, European J. Oper. Res. 120 (2000), 583–592.
Feremans, C.: Generalized spanning trees and extensions, Ph.D. thesis, Universite Libre de Bruxelles, Belgium.
Feremans, C., Labbe, M. and Laporte, G.: A comparative analysis of several formulations of the generalized minimum spanning tree problem, Networks 39(1) (2002), 29–34.
Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
Gerla, M. and Frata, L.: Tree structured fiber optics MAN's, IEEE J. Select. Areas Comm. SAC-6 (1988), 934–943.
Myung, Y. S., Lee, C. H. and w. Tcha, D.: On the generalized minimum spanning tree problem, Networks 26 (1995), 231–241.
Pop, P. C.: The generalized minimum spanning tree problem, Ph.D. thesis, University of Twente, The Netherlands, 2002.
Prisco, J. J.: Fiber optic regional area networks in New York and Dallas, IEEE J. Select. Areas Comm. SAC-4 (1986), 750–757.
Yannakakis, M.: Expressing combinatorial optimization problems by linear programs, J. Comput. System Sci. 43 (1991), 441–466.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pop, P.C. New Models of the Generalized Minimum Spanning Tree Problem. Journal of Mathematical Modelling and Algorithms 3, 153–166 (2004). https://doi.org/10.1023/B:JMMA.0000036579.83218.8d
Issue Date:
DOI: https://doi.org/10.1023/B:JMMA.0000036579.83218.8d