SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS
暂无分享,去创建一个
[1] Andreas T. Ernst,et al. Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.
[2] R. Prim. Shortest connection networks and some generalizations , 1957 .
[3] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[4] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] A. Volgenant. A Lagrangean approach to the degree-constrained minimum spanning tree problem , 1989 .
[7] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[8] Subhash C. Narula,et al. Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..
[9] Martin W. P. Savelsbergh,et al. Edge exchanges in the degree-constrained minimum spanning tree problem , 1985, Comput. Oper. Res..
[10] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.
[11] Narsingh Deo,et al. Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine , 1996, Parallel Comput..
[12] Narsingh Deo,et al. Computation of Constrained Spanning Trees: A Unified Approach , 1997 .
[13] Mitsuo Gen,et al. A note on genetic algorithms for degree-constrained spanning tree problems , 1997, Networks.