Two Matching Based Algorithm for Tree Network Design

References

• Altinkemer , K. and Gavish , B. 1988 . Heuristics with Constant Error Guarantees for the Design of Tree Networks . Management Science , 34 ( 3 ) : 331 – 341 .
   Google Scholar
• Altinkemer , K. 1989 . Parallel Savings Heuristics for Designing Multi Center Tree Networks . Proceedings of 1989 HICCS Conference , 22 : 762 – 769 .
   Google Scholar
• Altinkemer , K. and Pirkul , H. 1992 . Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem . Journal of Information & Optimization Sciences , 13 ( 1 ) : 49 – 71 .
   Google Scholar
• Beasley , J. E. 1983 . Route First-Component Second Methods for Vehicle Routing . Omega , 11 ( 4 ) : 403 – 408 .
   Web of Science ®Google Scholar
• Chandy , K. M. and Lo , T. 1973 . The Capacitated Minimum Tree . Networks , 3 ( 2 ) : 173 – 182 .
   Google Scholar
• Esau , L. R. and Williams , K. C. 1966 . On Teleprocessing System Design, Part 2 . IBM Syst. J. , 5 ( 3 ) : 142 – 147 .
   Google Scholar
• Garfinkel , R. S. and Nemhauser , G. L. 1972 . Integer Programming , John Wiley & Sons .
   Google Scholar
• Gavish , B. 1982 . Design Issues of Centralized Computer Networks-Formulations and Algorithms . Networks , 12 : 355 – 377 .
   Web of Science ®Google Scholar
• Gavish , B. 1983 . Formulations and Algorithms for the Capacitated Minimal Directed Tree . J. ACM , 30 : 118 – 132 .
   Web of Science ®Google Scholar
• Gavish , B. 1986 . Augmented Lagrangean Based Algorithms for centralized Network Design . IEEE Trans. Comm. , 33 : 1247 – 1257 .
   Google Scholar
• Gavish , B. and Altinkemer , K. 1986 . “ A Parallel Savings Heuristic for the Topological Design of Local Access Tree Networks ” . In Proceedings of IEEE-INFOCOM’86 130 – 139 .
   Google Scholar
• Gavish , B. , Li , C. L. and Simchi Levi , D. 1992 . Analysis of Heuristics for the Design of Tree Networks . Annals of OR ,
   Google Scholar
• Kershenbaum , A. and Chou , W. 1974 . A Unified Algorithm for Designing Multidrop Tele-processing Networks . IEEE Trans. Comm. , 22 ( 11 ) : 1762 – 1772 .
   Google Scholar
• Kershenbaum , A. , Boorstyn , R. and Oppenheim , R. 1980 . Second Order Greedy Algorithms for Centralized Teleprocessing Network Design . IEEE Trans. Comm. , 28 ( 10 ) : 1835 – 1838 .
   Google Scholar
• Kershenbaum , A. and Boorstyn , R. 1983 . Centralized Teleprocessing Network Design . Networks , 13 : 279 – 293 .
   Google Scholar
• Mole , R. H. , Johnson , D. G. and Wells , K. 1983 . Combinational Analysis for Route First-Cluster Second Vehicle Routing . Omega , 11 ( 5 ) : 507 – 512 .
   Web of Science ®Google Scholar
• Papadimitriou , C. 1978 . The Complexity of the Capacitated Tree Problem . Networks , 8 : 217 – 230 .
   Google Scholar
• Sharma , R. L. 1983 . Design of an Economical Multidrop Network Topology with Capacity Constraints . IEEE Trans. Comm. , 31 : 590 – 591 .
   Google Scholar