Hybrid Fiber Coaxial Network Design

References

• Adams R. Switched digital video on the rise. Telephony (1997) 232(17):18–24Google Scholar
• Altinkemer K., Gavish B. Parallel savings heuristics for the topological design of local access tree networks. Proc. IEEE INFOCOM '86 (1986) (IEEE, New York) 130–139Fifth Annual Conference on Computers and Communications Integration Design, Analysis, Management, Miami, FLGoogle Scholar
• Altinkemer K., Gavish B. Heuristics with constant error guarantees for the design of tree networks. Management Sci. (1988) 34(3):331–341Link, Google Scholar
• Amberg A., Domschke W., Voss S. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice (1996) 1(1):9–39Google Scholar
• Balakrishnan A., Magnanti T., Wong R. T. A decomposition algorithm for local access telecommunications network expansion planning. Oper. Res. (1995) 43(1):58–76Link, Google Scholar
• Brightman J. Hybrid fiber/coax: Front runner in the broadband transmission race. Telephony (1994) 227(2):42–50Google Scholar
• Brown P. Size doesn't matter. Broadcasting & Cable (1998) 128(19, May 4):76–78Google Scholar
• Cauley L., Blumenstein R. AT&T, Time Warner in cable-TV accord. The Wall Street Journal (1999) February 2):A3 columns 1, 2, 3A6 column 2Google Scholar
• Coleman P. Cablevision re-ups in Boston. Broadcasting & Cable (1998) May 18):50Google Scholar
• Esau L. R., Williams K. C. On teleprocessing systems design, Part II—A method for approximating the optimal network. IBM Systems J. (1966) 5(3):142–147Crossref, Google Scholar
• Fleurent C., Glover F. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. (1999) 11(2):198–204Link, Google Scholar
• Gasman L. High-speed access assessed. Telephony (1997) November24233(21):20–28Google Scholar
• Gavish B. Formulations and algorithms for the capacitated minimal directed tree problem. J. Assoc. Comput. Machinery (1983) 30:118–132Crossref, Google Scholar
• Gavish L. Topological design of telecommunications networks—Survey of local access network design methods. Ann. Oper. Res. (1991) 33:17–71Crossref, Google Scholar
• Glover F. A Multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. (1965) 13:879–919Link, Google Scholar
• Glover F. Heuristics for integer programming using surrogate constraints. Decision Sci. (1977) 8:156–166Crossref, Google Scholar
• Glover F., Barr R. S., Helgason R. V., Kennington J. L. Tabu search and adaptive memory programming—Advances, applications and challenges. Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies (1997) (Kluwer Academic Publisher, Boston, MA) Crossref, Google Scholar
• Gouveia L. A comparison of directed formulations for the capacitated minimum spanning tree problem. Telecomm. Systems (1993) 1:51–76Crossref, Google Scholar
• Gouveia L. A 2n constraint formulation for the capacitated minimum spanning tree problem. Oper. Res. (1995) 43:130–141Link, Google Scholar
• Gouveia L., Lopes M. J. Using generalized capacitated trees for designing the topology of local access networks. Telecomm. Systems (1997) 7:315–337Crossref, Google Scholar
• Gouveia L., Martins P. An extended flow based formulation for the capacitated minimal spanning tree. (1995) Paper presented at the Third ORSA Telecomm. Conf.Boca Raton, FLGoogle Scholar
• Gupta R. Problems in communication networks design and location planning: New solution procedures. (1996) . Dissertation, Fisher College of Business, The Ohio State University, Columbus, OHGoogle Scholar
• Gupta R., Pirkul H. Hybrid fiber co-axial CATV network design with variable capacity optical network units. Euro. J. Oper. Res. (2000) 123(1):73–85Crossref, Google Scholar
• Hall L. Experience with a cutting plane algorithm for the capacitated spanning tree problem. INFORMS J. Comput. (1996) 8(3):219–234Link, Google Scholar
• Karnaugh M. A new class of algorithms for multipoint network optimization. IEEE Trans. Commun. (1976) 24(5):500–505Crossref, Google Scholar
• Kershenbaum A., Boorstyn R., Oppenheim R. Second-order greedy algorithms for centralized network design. IEEE Trans. Comm. (1980) Com-22(11):1835–1838Crossref, Google Scholar
• Kershenbaum A., Chou W. A unified algorithm for designing multidrop teleprocessing networks. IEEE Trans. Comm. (1974) Com-22(11):1762–1772Crossref, Google Scholar
• Lee K., Park K., Park S. Design of capacitated networks with tree configurations. Telecomm. Systems (1996) 6:1–19Crossref, Google Scholar
• Levine S. @Home heads to work. Telephony (1997) March 3):8Google Scholar
• McGregor P. V., Shen D. Network design: An algorithm for the access facility location problem. IEEE Trans. Comm. (1977) Com-25(1):61–73Crossref, Google Scholar
• Narasimhan S. The concentrator location problem with variable coverage. Comput. Networks and ISDN Systems (1990) 19:1–10Crossref, Google Scholar
• Papadimitriou C. H. The complexity of the capacitated tree problem. Networks (1978) 4:217–230Crossref, Google Scholar
• Patterson R., Rolland E., Pirkul H. A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. J. Heuristics (1999) 5:159–180Crossref, Google Scholar
• Rolland E., Patterson R., Dodin B. A memory adaptive reasoning technique for solving the audit scheduling problem. (1998) . Working paper No. WP1998–002, Center for Advanced Information and Telecommunication Technology Applications, School of Management, University of Texas at Dallas, Dallas, TXGoogle Scholar
• Rolland E., Patterson R., Pirkul H., Voss S., Martello S., Osman I., Roucairol C. Memory adaptive reasoning and greedy assignment techniques for the CMST. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1999) (Kluwer Academic Publishers, Norwell, MA) 487–498Crossref, Google Scholar
• Sharaiha Y. M., Gendreau M., Laporte G., Osman I. H. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks (1997) 29:161–171Crossref, Google Scholar
• Soltys J. R., Fischer M. J., Roth B. D. FTS2000 access optimization. Fifth Internat. Conf. on Telecomm. Systems, Modeling and Analysis (1997) Nashville, TNGoogle Scholar
• Vittore V. Cable telephony rebounds. Telephony (1997) December 15):6Google Scholar
• Watson S. Bandwidth booster. Telephony (1997) 233(17, October 6):24–34Google Scholar
• Wilder T., Van Beaver S. Mixed nuts: Automated provisioning, HFC and IP. America's Network (1998) September 1):30–34Google Scholar