Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H., Birge J. R., Murty K. G. Branch-and-price: Column generation for solving huge integer programs. Mathematical Programming: State of the Art (1994) (University of Michigan, Ann Arbor, MI.) Google Scholar
• Chung S. H., Myung Y. S., Tcha D. W. Optimal design of a distributed network with a two-level hierarchical structure. European J. of Oper. Res. (1992) 62:105–115Crossref, Google Scholar
• Coan R. A., Leland W. E., Vecchi M. P., Weinrib A., Wu T. U. Using distributed topology update and preplanned configurations to achieve trunk network survivability. IEEE Trans. Reliability (1991) 40:404–416Crossref, Google Scholar
• Conforti M., Rao M. R., Sassano A. The equipartition polytope I: Formulations, dimension, and basic facets. Math. Programming (1990a) 49:49–70Crossref, Google Scholar
• Conforti M. The equipartition polytope II: Formulations, valid inequalities and facets. Math. Programming (1990b) 49:71–90Crossref, Google Scholar
• Flanagan T. Fiber network survivability. IEEE Communications Magazine (1991) June):46–53Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability (1979) (W. H. Freeman and Company, San Francisco, CA) Google Scholar
• Gavish B., Pirkul H. Computer and database location in distributed computer systems. IEEE Trans. Comput. (1986) C-35:583–590Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting-stock problem. Oper. Res. (1961) 9:849–859Link, Google Scholar
• Grover W. D.The self-healing network: A fast distributed restoration technique for networks using digital crossconnect machines (1987) Proceedings on IEEE Global Telecommunication Conference(Tokyo, Japan)Google Scholar
• Helme M. P., Magnanti T. L. Designing satellite communication networks by zero-one quadratic programming. Networks (1989) 19:427–450Crossref, Google Scholar
• Johnson E. L., Mehrotra A., Nemhauser G. L. Min-cut clustering. Math. Programming (1993) 62:133–152Crossref, Google Scholar
• Kim J. G., Tcha D. W. Optimal design of a two-level hierarchical network with tree-star configuration. Comput. I.E. (1992) 22:273–281Crossref, Google Scholar
• Laguna M. Clustering for the design of SONET rings in interoffice telecommunications. Management Sci.40:1533–1541Link, Google Scholar
• Lee C. H., Ro H. Y., Tcha D. W. Topological design of a two-level network with ring-star configuration. Comput. Oper. Res. (1993) 20:625–637Crossref, Google Scholar
• Lee K., Park K., Park S., Lee H. Economic spare capacity planning for DCS mesh-restorable networks. European J. Oper. Res. (1998) 110:63–75Crossref, Google Scholar
• Lee K., Park K., Park S. Design of capacitated networks with tree configurations. Telecommunication Systems (1996a) 6:1–19Crossref, Google Scholar
• Lee Y., Lim B. H., Park J. S. A hub location problem in designing digital data service networks: Lagrangian relaxation approach. Location Sci. (1996b) 4:185–194Crossref, Google Scholar
• Mirzaian A. Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks (1985) 15:1–20Crossref, Google Scholar
• Padberg M. The Boolean quadric polytope: Some characteristics, facets and relatives. Math. Programming (Series B) (1989) 45:139–172Crossref, Google Scholar
• Padberg M., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100Crossref, Google Scholar
• Park K., Kang S., Park S. An integer programming approach to the bandwidth packing problem. Management Sci. (1996a) 42:1277–1291Link, Google Scholar
• Park K., Lee K., Park S. An extended formulation approach to the edge-weighted maximal clique problem. European J. Oper. Res. (1996b) 95:671–682Crossref, Google Scholar
• Park K., Lee K., Park S.Polyhedral results on the extended node packing polytope (1994) . Working paper KAIST, Taejon, KoreaGoogle Scholar
• Wu T-H.Fiber Network Service Survivability (1992) (Artech House Inc., Norwood, MA) Google Scholar