The generalized minimum spanning tree problem

We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound procedure and an upper bound procedure and present the advantages of our approach in comparison with an earlier method. We present a solution procedure for solving GMST problem using cutting planes.

[1]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[2]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[3]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[4]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[5]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

[6]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[7]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[8]  C. Lemaréchal,et al.  Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization , 1999 .

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[11]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[13]  A. Zelikovsky,et al.  An improved approximation scheme for the Group Steiner Problem , 2001 .

[14]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[15]  M. Todd.  A study of search directions in primal-dual interior-point methods for semidefinite programming , 1999 .

[16]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[17]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..

[18]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

[19]  Petrica C. Pop.  Relaxation methods for the generalized minimum spanning tree problem , 2002 .

[20]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[23]  G. P. Barker,et al.  Cones of diagonally dominant matrices , 1975 .

[24]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[25]  O. Taussky.  Positive-definite matrices and their role in the study of the characteristic roots of general matrices☆ , 1968 .

[26]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[27]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[28]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

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

[30]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

[31]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

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

[33]  R. Bellman.  Dynamic programming. , 1957, Science.

[34]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

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

[37]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[38]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[39]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[40]  Alan F. Blackwell,et al.  Programming , 1973, CSC '73.

[41]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[42]  R. Bellman,et al.  On Systems of Linear Inequalities in Hermitian Matrix Variables , 1962 .

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

[44]  Moshe Dror,et al.  Generalized Steiner Problems and Other Variants , 2000, J. Comb. Optim..

[45]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[46]  Jacobus P. H. Wessels,et al.  The art and theory of dynamic programming , 1977 .

[47]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[48]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[49]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[50]  Gerhard J. Woeginger,et al.  Approximation schemes-a tutorial , 2001 .

[51]  Martin Grötschel,et al.  Discrete mathematics in manufacturing , 1992 .

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

[53]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[54]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[55]  P. Gács,et al.  Algorithms , 1992 .

[56]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[57]  An easy way to obtain strong duality results in linear , linear semidefinite and linear semi-infinite programming , 1999 .

[58]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[59]  Barry J. Wythoff,et al.  Backpropagation neural networks , 1993 .

[60]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[61]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[62]  Yin Zhang,et al.  A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming , 1998, Math. Program..

[63]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[64]  Gilbert Laporte,et al.  Polyhedral Analysis of the Generalized Minimum Spanning Tree Problem , 1999 .

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

[66]  An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming , 1999 .

[67]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[68]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[69]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

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