A survey of different integer programming formulations of the generalized minimum spanning tree problem

In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations of the problem. The GMSTP is a variant of the classical minimum spanning tree problem (MST), in which the nodes of an undirected graph are partitioned into node sets (clusters) and we are looking for a minimum cost tree spanning a subset of nodes which includes exactly one node from every cluster. In this paper we describe twelve distinct formulations of the GMSTP based on integer programming. Apart from the standard formulations all the new formulations that we describe are ’compact’ in the sense that the number of constraints and variables is a polynomial function of the number of nodes in the problem. Comparisons of the polytopes corresponding to their linear relaxations are established.

[1]  Diptesh Ghosh.  Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems , 2003 .

[2]  Petrica C. Pop.  On the prize-collecting generalized minimum spanning tree problem , 2007, Ann. Oper. Res..

[3]  Gilbert Laporte,et al.  A comparative analysis of several formulations for the generalized minimum spanning tree problem , 2002, Networks.

[4]  Daliborka Stanojevic.  Optimization of Contemporary Telecommunications Networks: Generalized Spanning Trees and WDM Optical Networks , 2005 .

[5]  Diptesh Ghosh.  A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem , 2003 .

[6]  Corinne Feremans.  Generalized Spanning Trees and Extensions , 2001 .

[7]  S Dallas Ran.  Fiber Optic Regional Area Networks in New York and Dallas , 1986 .

[8]  Corina Pop Sitar,et al.  A NOTE ON THE COMPLEXITY OF THE GENERALIZED MINIMUM SPANNING TREE PROBLEM , 2004 .

[9]  Alexander Grigoriev,et al.  The geometric generalized minimum spanning tree problem with grid clustering , 2006, 4OR.

[10]  Markus Leitner,et al.  Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search , 2005 .

[11]  M. Yannakakis.  Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.

[12]  Moshe Dror,et al.  Generalized spanning trees , 2000, Eur. J. Oper. Res..

[13]  S. Raghavan,et al.  Heuristic Search for the Generalized Minimum Spanning Tree Problem , 2005, INFORMS J. Comput..

[14]  Markus Leitner,et al.  Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.

[15]  D. Gale.  A theorem on flows in networks , 1957 .

[16]  Petrica C. Pop,et al.  A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

[17]  Petrica C. Pop,et al.  Combining heuristics and modifying local information to guide ant-based search , 2008 .

[18]  S. Raghavan,et al.  The prize-collecting generalized minimum spanning tree problem , 2008, J. Heuristics.

[19]  Gilbert Laporte,et al.  The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm , 2004, Networks.

[20]  Petrica C. Pop,et al.  An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size , 2005, ACiD.

[21]  Luigi Fratta,et al.  Tree structured fiber optics MANs , 1988, IEEE J. Sel. Areas Commun..

[22]  Chan Hou Che,et al.  Tabu search for generalized minimum spanning tree problem , 2006 .

[23]  Temel Öncan,et al.  A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..

[24]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[25]  P. Pop.  The generalized minimum spanning tree problem , 2000 .