Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

The Capacltated Minmaal Directed Tree Problem is fundamental m many network design problems. A new linear integer programming formulauon of the problem which leads to a Dantzlg-Wolfe decomposmon and to a new Lagrangean relaxation procedure for the Capacaated Mmunal Directed Tree Problem as presented This relaxation is used for deriving tight lower bounds on the optunal solution and m heunsucs for obtaining approxtmate solutions The effectiveness of the procedure is demonstrated in computational tests Categories and SubJect Descriptors: C.2.1 [Computer-Communication Networks]: Network Architecture and Design--network topology; D 4.8 [Operating Systems]: Performance--modehng and predwtion; G 2.1 [Discrete Mathematics]: Combinatoncs--combmatorml algorithms; G.2.2 [Di~tete Mathematics]. Graph Theory--trees General Terms. Algonthrns, Management, Theory Ad&tional

[1]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

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

[3]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[4]  A. Kershenbaum,et al.  Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design , 1980, IEEE Trans. Commun..

[5]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[6]  Harold N. Gabow.  A good algorithm for smallest spanning trees with a degree constraint , 1978, Networks.

[7]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[8]  M. Karnaugh.  A New Class of Algorithms for Multipoint Network Optimization , 1976, IEEE Trans. Commun..

[9]  George H. Mealy.  The Functional Structure of OS/360 Part I: Introductory Survey , 1966, IBM Syst. J..

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

[11]  Michael HELD,et al.  THE TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES : PART 1 I * , .

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

[13]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

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

[15]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[16]  Aaron Kershenbaum,et al.  Computing capacitated minimal spanning trees efficiently , 1974, Networks.