{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T09:30:15Z","timestamp":1664962215181},"reference-count":18,"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\/bf02136163","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T03:17:37Z","timestamp":1126754257000},"page":"243-261","source":"Crossref","is-referenced-by-count":4,"title":["A methodology for designing large private line transmission networks with multiple facilities"],"prefix":"10.1007","volume":"1","author":[{"given":"M. J.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. W.","family":"Swinsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. P.","family":"Garland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. E.","family":"Stanfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02136163_CR1","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.39.6.925","volume":"39","author":"R.D. Doverspike","year":"1991","unstructured":"R.D. Doverspike, Algorithms for multiplex bundling in a telecommunication network, Oper. Res. 39(1991)925\u2013945.","journal-title":"Oper. Res."},{"key":"BF02136163_CR2","unstructured":"F. Glover and M. Laguna, Bandwidth packing: A tabu search approach, Research Report, Graduate School of Business and Administration, University of Colorado at Boulder."},{"key":"BF02136163_CR3","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1109\/49.35564","volume":"SAC-7","author":"R.H. Cardwell","year":"1989","unstructured":"R.H. Cardwell, C.L. Monma and T.H. Wu, Computer-aided design procedures for survivable fiber optic networks, IEEE Trans. Sel. Areas Commun. SAC-7(1989)1188\u20131191.","journal-title":"IEEE Trans. Sel. Areas Commun."},{"key":"BF02136163_CR4","unstructured":"T.S. Magnanti, P. Mirchandani and R. Vachani, Capacitated netwrok design with a choice of two facilities,ORSA\/TIMS Meeting, Vancouver BC (May 1989)."},{"key":"BF02136163_CR5","unstructured":"Defense Communications Agency, Circuit switched network design analysis model, Defense Communications Engineering Center, Reston, VA (March 1989)."},{"key":"BF02136163_CR6","volume-title":"A knowledge system for DDN backbone design, Report No. UVA\/525652\/SE87\/101","author":"DESI","year":"1986","unstructured":"DESI: A knowledge system for DDN backbone design, Report No. UVA\/525652\/SE87\/101, Department of Systems Engineering, University of Virginia, Charlottesville, VA (August 1986)."},{"key":"BF02136163_CR7","unstructured":"H. Pirkul, Location of concentrators in designing local access networks,IEEE INFOCOM'86, Miami, FL (April 1986), pp. 148\u2013154."},{"key":"BF02136163_CR8","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"G. Cornuejols et al., Location of bank accounts to optimize float: An analytic study of exact and approximate algorithm, Manag. Sci. 23(1977)789\u2013810.","journal-title":"Manag. Sci."},{"key":"BF02136163_CR9","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"G. Cornuejols et al., The uncapacitated facility location problem, in:Discrete Location Theory, ed. P. Mirchandani and R. Francis (Wiley, New York, 1990)."},{"key":"BF02136163_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Manag. Sci. 27(1981)1\u201318.","journal-title":"Manag. Sci."},{"key":"BF02136163_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M.L. Fisher","year":"1985","unstructured":"M.L. Fisher, An applications oriented guide to Lagrangian relaxation, Interfaces 15(1985)10\u201321.","journal-title":"Interfaces"},{"key":"BF02136163_CR12","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, Comput. Oper. Res. 14(1987)197\u2013208.","journal-title":"Comput. Oper. Res."},{"key":"BF02136163_CR13","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":"BF02136163_CR14","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 P. De, Locating concentrators for primary and secondary coverage in a computer communications network, IEEE Trans. Commun. COM-36(1988)450\u2013458.","journal-title":"IEEE Trans. Commun."},{"key":"BF02136163_CR15","volume-title":"Operations Research: Applications and Algorithms","author":"W.L. Winston","year":"1991","unstructured":"W.L. Winston,Operations Research: Applications and Algorithms, 2nd ed. (PWS-Kent Publ. Co., Boston, MA, 1991).","edition":"2nd ed."},{"key":"BF02136163_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick et al., Optimization by simulated annealing, Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02136163_CR17","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D. Johnson","year":"1989","unstructured":"D. Johnson et al., Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning, Oper. Res. 37(1989)865\u2013892.","journal-title":"Oper. Res."},{"key":"BF02136163_CR18","volume-title":"Introduction to Queueing Theory","author":"R.B. Cooper","year":"1984","unstructured":"R.B. Cooper,Introduction to Queueing Theory, 2nd ed. (Elsevier Science, New York, 1984).","edition":"2nd ed."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136163.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02136163\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02136163","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\/BF02136163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02136163"],"URL":"https:\/\/doi.org\/10.1007\/bf02136163","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}