{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:36:37Z","timestamp":1754397397936},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02136157","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T03:17:37Z","timestamp":1126754257000},"page":"99-131","source":"Crossref","is-referenced-by-count":40,"title":["Telecommunications network topological design and capacity expansion: Formulations and algorithms"],"prefix":"10.1007","volume":"1","author":[{"given":"Suk-Gwon","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bezalel","family":"Gavish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02136157_CR1","unstructured":"Y.K. Agarwal, Integer programming for telecommunications network design, Paper presented at 1st ORSA Telecom. SIG Conf."},{"key":"BF02136157_CR2","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large scale uncapacitated network design, Oper. Res. 37(1989)716\u2013740.","journal-title":"Oper. Res."},{"key":"BF02136157_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01580236","volume":"6","author":"N. Christofides","year":"1974","unstructured":"N. Christofides and P. Brooker, Optimal expansion of an existing network, Math. Progr. 6(1974)197\u2013211.","journal-title":"Math. Progr."},{"key":"BF02136157_CR4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"H. Crowder and M.W. Padberg, Solving large-scale symmetric traveling salesman problems to optimality, Manag. Sci. 26(1980)495\u2013509.","journal-title":"Manag. Sci."},{"key":"BF02136157_CR5","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1287\/opre.23.4.810","volume":"23","author":"P.J. Doulliez","year":"1975","unstructured":"P.J. Doulliez and M.R. Rao, Optimal network capacity planning: A shortest path scheme, Oper. Res. 23(1975)811\u2013818.","journal-title":"Oper. Res."},{"key":"BF02136157_CR6","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Oper. Res. 26(1978)992\u20131009.","journal-title":"Oper. Res."},{"key":"BF02136157_CR7","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":"BF02136157_CR8","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. Commun. COM-33(1985)1247\u20131257.","journal-title":"IEEE Trans. Commun."},{"key":"BF02136157_CR9","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","volume":"2","author":"B. Gavish","year":"1990","unstructured":"B. Gavish and K. Altinkemer, Backbone network design tools with economic tradeoffs, ORSA J. Comp. 2(1990)236\u2013245.","journal-title":"ORSA J. Comp."},{"key":"BF02136157_CR10","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/opre.34.5.698","volume":"34","author":"B. Gavish","year":"1986","unstructured":"B. Gavish and K. Srikanth, An optimal solution method for large-scale multiple traveling salesman problems, Oper. Res. 34(1986)698\u2013717.","journal-title":"Oper. Res."},{"key":"BF02136157_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"D.S. Johnson, J.K. Lenstra and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks 8(1978)279\u2013285.","journal-title":"Networks"},{"key":"BF02136157_CR12","first-page":"283","volume":"31","author":"M. Minoux","year":"1987","unstructured":"M. Minoux, Network synthesis and dynamic network optimization, Ann. Discr. Math. 31(1987)283\u2013324.","journal-title":"Ann. Discr. Math."},{"key":"BF02136157_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02094336","volume":"36","author":"S.H. Parrish","year":"1992","unstructured":"S.H. Parrish, T. Cox, W. Kuehner and Y. Qui, Planning for optimal expansion of leased line communication networks, Ann. Oper. Res. 36(1992)347\u2013364.","journal-title":"Ann. Oper. Res."},{"key":"BF02136157_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230100402","volume":"10","author":"D.R. Shier","year":"1980","unstructured":"D.R. Shier and C. Witzgall, Arc tolerances in shortest path and network flow problems, Networks 10(1980)277\u2013291.","journal-title":"Networks"},{"key":"BF02136157_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230040104","volume":"4","author":"N. Zadeh","year":"1974","unstructured":"N. Zadeh, On building minimum cost communication networks over time, Networks 4(1974)19\u201334.","journal-title":"Networks"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136157.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02136157\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T05:22:46Z","timestamp":1557811366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02136157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02136157"],"URL":"https:\/\/doi.org\/10.1007\/bf02136157","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}