论文信息 - Edge exchanges in the degree-constrained minimum spanning tree problem - 字舞流文

Edge exchanges in the degree-constrained minimum spanning tree problem

Martin W. P. Savelsbergh | A. Volgenant | A. Volgenant | M. Savelsbergh | Ton Volgenant

[1] R. Jonker,et al. The symmetric traveling salesman problem and edge exchanges in minimal 1-trees , 1983 .

[2] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[3] R. Jonker,et al. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[4] Subhash C. Narula,et al. Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

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

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

[7] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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