{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:55:42Z","timestamp":1771235742467,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1007\/bf02061657","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T10:27:23Z","timestamp":1123842443000},"page":"17-71","source":"Crossref","is-referenced-by-count":128,"title":["Topological design of telecommunication networks-local access design methods"],"prefix":"10.1007","volume":"33","author":[{"given":"Bezalel","family":"Gavish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02061657_CR1","unstructured":"K. Altinkemer, Parallel savings heuristic for designing multicenter tree networks,Proc. HICSS-22 (1989), pp.762\u2013769."},{"key":"BF02061657_CR2","unstructured":"K. Altinkemer and B. Gavish, Parallel savings heuristic for the delivery problem, Oper. Res., in print."},{"key":"BF02061657_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K. Altinkemer","year":"1987","unstructured":"K. Altinkemer and B. Gavish, Heuristics for unequal weight delivery problems with a fixed error guarantee, Oper. Res. Lett. 6(1987)149\u2013158.","journal-title":"Oper. Res. Lett."},{"key":"BF02061657_CR4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","volume":"34","author":"K. Altinkemer","year":"1988","unstructured":"K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks, Manag. Sci. 34(1988)331\u2013341.","journal-title":"Manag. Sci."},{"key":"BF02061657_CR5","unstructured":"K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Transp. Sci., in print."},{"key":"BF02061657_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J.E. Beasley","year":"1983","unstructured":"J.E. Beasley, Route first-component second methods for vehicle routing, Omega 11(1983)403\u2013408.","journal-title":"Omega"},{"key":"BF02061657_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"COM-25","author":"R.R. Boorstyn","year":"1977","unstructured":"R.R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Trans. Comm. COM-25(1977)29\u201347.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR8","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P.M. Camerini","year":"1980","unstructured":"P.M. Camerini, G. Galbiati and F. Maffioli, Complexity of spanning tree problems: Part 1, Eur. J. Oper. Res. 5(1980)346\u2013352.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02061657_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","volume":"5","author":"P.M. Camerini","year":"1983","unstructured":"P.M. Camerini, G. Galbiati and F. Maffioli, On the complexity of finding multi-constrained spanning trees, Discr. Appl. Math. 5(1983)39\u201350.","journal-title":"Discr. Appl. Math."},{"key":"BF02061657_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230030204","volume":"3","author":"K.M. Chandy","year":"1973","unstructured":"K.M. Chandy and T. Lo, The capacitated minimum tree, Networks 3(1973)173\u2013182.","journal-title":"Networks"},{"key":"BF02061657_CR11","first-page":"1062","volume":"COM-21","author":"K.M. Chandy","year":"1972","unstructured":"K.M. Chandy and K.M. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comm. COM-21(1972)1062\u20131066.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR12","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report No. 388, Graduate School of Industrial Administration, Carnegie-Mellon University (Feb. 1976)."},{"key":"BF02061657_CR13","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"N. Christofides, A. Mingozzi and P. Toth, The vehicle routing problem, in:Combinatorial Optimization (Wiley, New York, 1979)."},{"key":"BF02061657_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"N. Christofides, A. Mingozzi and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math. Progr. 20(1981)255\u2013282.","journal-title":"Math. Progr."},{"key":"BF02061657_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"S. Eilon","year":"1971","unstructured":"S. Eilon and N. Christofides, The loading problem, Manag. Sci. 17(1971)259\u2013268.","journal-title":"Manag. Sci."},{"key":"BF02061657_CR16","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TCOM.1974.1092122","volume":"COM-22","author":"D. Elias","year":"1974","unstructured":"D. Elias and M.J. Ferguson, Topological design of multipoint teleprocessing networks, IEEE Trans. Comm. COM-22(1974)1753\u20131762.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","volume":"5","author":"L.R. Esau","year":"1966","unstructured":"L.R. Esau and K.C. Williams, On teleprocessing system design, Part 2, IBM Syst. J. 5(1966)142\u2013147.","journal-title":"IBM Syst. J."},{"key":"BF02061657_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish, Topological design of centralized computer networks \u2014 formulations and algorithms, Networks 12(1982)355\u2013377.","journal-title":"Networks"},{"key":"BF02061657_CR19","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","volume":"30","author":"B. Gavish","year":"1983","unstructured":"B. Gavish, Formulations and algorithms for the capacitated minimal directed tree, J. ACM 30(1983)118\u2013132.","journal-title":"J. ACM"},{"key":"BF02061657_CR20","unstructured":"B. Gavish, The delivery problem \u2014 new cutting plane procedures,TIMS 26th Int. Meeting, Copenhagen (1984)."},{"key":"BF02061657_CR21","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","volume":"COM-33","author":"B. Gavish","year":"1985","unstructured":"B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Comm. COM-33(1985)1247\u20131257.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR22","doi-asserted-by":"crossref","unstructured":"B. Gavish, Topological design of computer communication networks \u2014 the overall design problem, Eur. J. Oper. Res., to be published.","DOI":"10.1016\/0377-2217(92)90204-M"},{"key":"BF02061657_CR23","unstructured":"B. Gavish, Topological design and capacity assignment in computer communication networks, Working Paper, Owen Graduate School of Management (1990)."},{"key":"BF02061657_CR24","unstructured":"B. Gavish and K. Altinkemer, A parallel savings heuristic for the topological design of local access tree networks,Proc. IEEE-INFOCOM'86 (1986), pp. 130\u2013139."},{"key":"BF02061657_CR25","doi-asserted-by":"crossref","unstructured":"B. Gavish, C.L. Li and D. Simchi-Levi, Analysis of heuristics for the design of tree networks, Ann. of Oper. Res., to be published.","DOI":"10.1007\/BF02094324"},{"key":"BF02061657_CR26","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/TCT.1973.1083655","volume":"CT-20","author":"M.C. Goldstein","year":"1973","unstructured":"M.C. Goldstein, Design of long-distance telecommunication networks \u2014 the Telepak problem, IEEE Trans. Circuit Theory CT-20(1973)186\u2013192.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"BF02061657_CR27","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"M. Haimovich and A. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math. Oper. Res. 10(1985)527\u2013542.","journal-title":"Math. Oper. Res."},{"key":"BF02061657_CR28","unstructured":"E. Hansler, A heuristic configuration procedure for cost minimal communication networks, IBM Research Report RZ-666 (1974)."},{"key":"BF02061657_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"D.B. Johnson, Shortest paths in dense networks, J. ACM 24(1977)1\u201313.","journal-title":"J. ACM"},{"key":"BF02061657_CR30","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","volume":"COM-24","author":"M. Karnaugh","year":"1976","unstructured":"M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Comm. COM-24(1976)500\u2013505.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR31","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TCOM.1974.1092123","volume":"COM-22","author":"A. Kershenbaum","year":"1974","unstructured":"A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Comm. COM-22(1974)1762\u20131772.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR32","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","volume":"COM-28","author":"A. Kershenbaum","year":"1980","unstructured":"A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second order greedy algorithms for centralized teleprocessing network design, IEEE Trans. Comm. COM-28(1980)1835\u20131838.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR33","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230130211","volume":"13","author":"A. Kershenbaum","year":"1983","unstructured":"A. Kershenbaum and R. Boorstyn, Centralized teleprocessing network design, Networks 13(1983)279\u2013293.","journal-title":"Networks"},{"key":"BF02061657_CR34","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7(1956)48\u201350.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF02061657_CR35","series-title":"Working Paper","volume-title":"Analysis of heuristcs for the multi-depot capacitated vehicle routing problems","author":"C.L. Li","year":"1989","unstructured":"C.L. Li and D. Simchi-Levi, Analysis of heuristcs for the multi-depot capacitated vehicle routing problems, Working Paper, Department of Industrial Engineering and Operations Research, Columbia University, New York (1989)."},{"key":"BF02061657_CR36","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TCOM.1977.1093710","volume":"COM-25","author":"P.M. McGregor","year":"1977","unstructured":"P.M. McGregor and D. Shen, Network design: An algorithm for access facility location problems, IEEE Trans. Comm. COM-25(1977)61\u201373.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230150102","volume":"15","author":"A. Mirzaian","year":"1985","unstructured":"A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15(1985)1\u201320.","journal-title":"Networks"},{"key":"BF02061657_CR38","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0305-0483(83)90043-9","volume":"11","author":"R.H. Mole","year":"1983","unstructured":"R.H. Mole, D.G. Johnson and K. Wells, Combinatorial analysis for route first-component second vehicle routing, Omega 11(1983)507\u2013512.","journal-title":"Omega"},{"key":"BF02061657_CR39","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","volume":"8","author":"C.H. Papadimitriou","year":"1978","unstructured":"C.H. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217\u2013230.","journal-title":"Networks"},{"key":"BF02061657_CR40","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H. Pirkul","year":"1987","unstructured":"H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Comp. Oper. Res. 14(1987)197\u2013208.","journal-title":"Comp. Oper. Res."},{"key":"BF02061657_CR41","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/26.2769","volume":"COM-36","author":"H. Pirkul","year":"1988","unstructured":"H. Pirkul, S. Narasimhan and R. De, Locating concentrators for primary and secondary coverage in a computer communication network, IEEE Trans. Comm. COM-36(1988)450\u2013458.","journal-title":"IEEE Trans. Comm."},{"key":"BF02061657_CR42","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389\u20131401.","journal-title":"Bell. Syst. Tech. J."},{"key":"BF02061657_CR43","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D. Rosenkrantz","year":"1977","unstructured":"D. Rosenkrantz, R. Sterns and P. Lewis, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comp. 6(1977)563\u2013581.","journal-title":"SIAM J. Comp."},{"key":"BF02061657_CR44","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.19.1.156","volume":"19","author":"B. Rothfarb","year":"1971","unstructured":"B. Rothfarb and M.C. Goldstein, The one-terminal Telepak problem, Oper. Res. 19(1971) 156\u2013169.","journal-title":"Oper. Res."},{"key":"BF02061657_CR45","first-page":"1","volume":"6","author":"G.M. Schneider","year":"1982","unstructured":"G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Comp. Networks 6(1982)1\u201311.","journal-title":"Comp. Networks"},{"key":"BF02061657_CR46","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/TCOM.1983.1095845","volume":"COM-31","author":"R.L. Sharma","year":"1983","unstructured":"R.L. Sharma, Design of an economical multidrop network topology with capacity constraints, IEEE Trans. Comm. COM-31(1983)590\u2013591.","journal-title":"IEEE Trans. Comm."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02061657.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02061657\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02061657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:04:57Z","timestamp":1557839097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02061657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["BF02061657"],"URL":"https:\/\/doi.org\/10.1007\/bf02061657","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}