{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:53:29Z","timestamp":1648947209742},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":[[1992,12]]},"DOI":"10.1007\/bf02094337","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T14:16:52Z","timestamp":1126534612000},"page":"365-381","source":"Crossref","is-referenced-by-count":7,"title":["Topological design of wide area communication networks"],"prefix":"10.1007","volume":"36","author":[{"given":"Kemal","family":"Altinkemer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02094337_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/opre.34.2.237","volume":"34","author":"P. Afentakis","year":"1986","unstructured":"P. Afentakis and B. Gavish, Optimal lot-sizing algorithms for complex product structures, Oper. Res. 34 (1986) 237\u2013249.","journal-title":"Oper. Res."},{"key":"BF02094337_CR2","doi-asserted-by":"crossref","unstructured":"V. Ahuja, Routing and flow control in systems network architecture, IBM Syst. J. (1979) 298\u2013314.","DOI":"10.1147\/sj.182.0298"},{"key":"BF02094337_CR3","doi-asserted-by":"crossref","unstructured":"A. Balakrishnan and K. Altinkemer, Using hop constrained model to generate alternative communication network designs. Designing communication networks with hop restrictions, ORSA J. Comput. (1991) (in print).","DOI":"10.1287\/ijoc.4.2.192"},{"key":"BF02094337_CR4","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. Commun. COM-25 (1977) 29\u201347.","journal-title":"IEEE Trans. Commun."},{"key":"BF02094337_CR5","unstructured":"M.A. Bonuccelli, Allocating additional link capacities in computer communication networks, IBM Res. Report RC 8967 (1981)."},{"key":"BF02094337_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"P.M. Camerini, L. Fratta and F. Maffioli, On improving relaxation methods by modified gradient techniques, Math. Prog. Study 3 (1975) 26\u201334.","journal-title":"Math. Prog. Study"},{"key":"BF02094337_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"L. Fratta, M. Gerla and L. Kleinrock, The flow deviation algorithm: an approach to store-and forward computer communication network design, Networks 3 (1973) 97\u2013133.","journal-title":"Networks"},{"key":"BF02094337_CR8","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":"BF02094337_CR9","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 problem, J. ACM 30 (1983) 118\u2013132.","journal-title":"J. ACM"},{"key":"BF02094337_CR10","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","volume":"COM-31","author":"B. Gavish","year":"1983","unstructured":"B. Gavish and S.L. Hantler, An algorithm for the optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154\u20131161.","journal-title":"IEEE Trans. Commun."},{"key":"BF02094337_CR11","first-page":"1584","volume":"86","author":"B. Gavish","year":"1986","unstructured":"B. Gavish, A general model for the topological design of computer networks,Proc. IEEE-GLOBECOM 86 (1986) pp. 1584\u20131588.","journal-title":"Proc. IEEE-GLOBECOM"},{"key":"BF02094337_CR12","first-page":"275","volume":"86","author":"B. Gavish","year":"1986","unstructured":"B. Gavish and I. Neuman, Capacity and flow assignment in large computer networks,Proc. IEEE-GLOBECOM 86 (1986) pp. 275\u2013284.","journal-title":"Proc. IEEE-GLOBECOM"},{"key":"BF02094337_CR13","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. Comput. 2 (1990) 236\u2013252.","journal-title":"ORSA J. Comput."},{"key":"BF02094337_CR14","doi-asserted-by":"crossref","unstructured":"B. Gavish and I. Neuman, Routing in a network with unreliable components, IEEE Trans. Commun. (1991) (in print).","DOI":"10.1109\/26.153370"},{"key":"BF02094337_CR15","unstructured":"B. Gavish, Topological design of computer communication networks \u2014 The overall design problem, EJOR (1991) (in print)."},{"key":"BF02094337_CR16","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, Lagrangian relaxation and its uses in integer programming, Math. Progr. Study 2 (1974) 82\u2013114.","journal-title":"Math. Progr. Study"},{"key":"BF02094337_CR17","doi-asserted-by":"crossref","unstructured":"M. Gerla, Deterministic and adaptive routing policies in packet switched computer networks,ACM-IEEE 3rd Data Communications Symp., Tampa, FL (1973).","DOI":"10.1145\/800280.811026"},{"key":"BF02094337_CR18","unstructured":"M. Gerla, H. Frank, W. Chou and J. Eckle, A cut saturation algorithm for topological design of packet switched communication networks,Proc. NTC (1974) pp. 1074\u20131085."},{"key":"BF02094337_CR19","unstructured":"M. Gerla, Approximations and bounds for the topological design of distributed computer networks,Proc. 4th ACM Data Communications Symp., Quebec, Canada (1975)."},{"key":"BF02094337_CR20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"COM-25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25 (1977) 48\u201360.","journal-title":"IEEE Trans. Commun."},{"key":"BF02094337_CR21","unstructured":"K. Maruyama and D.T. Tang, Discrete link capacity assignment in communication networks,3rd ICCC, Toronto (1976) pp. 92\u201397."},{"key":"BF02094337_CR22","doi-asserted-by":"crossref","unstructured":"K. Maruyama, K. Fratta and D.T. Tang, Heuristic design algorithm for computer communication networks with different classes of customers, IBM J. Res. Dev. (1977) 360\u2013369.","DOI":"10.1147\/rd.214.0360"},{"key":"BF02094337_CR23","unstructured":"I. Neuman, Methods for the design of computer networks with different classes of messages, Working Paper, NYU (1988)."},{"key":"BF02094337_CR24","unstructured":"H. Pirkul and S. Narasimhan, A new algorithm for the design of backbone networks, Working Paper, College of Business, Ohio State University (1987)."},{"key":"BF02094337_CR25","doi-asserted-by":"crossref","unstructured":"H. Pirkul and S. Narasimhan, Primary and secondary route selection in backbone computer networks, Working Paper, College of Business, Ohio State University (1988).","DOI":"10.1016\/0169-7552(88)90048-7"},{"key":"BF02094337_CR26","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TCOM.1981.1095020","volume":"COM-29","author":"L.R.W. Tymes","year":"1981","unstructured":"L.R.W. Tymes, Routing and flow control in TYMNET, IEEE Trans. Commun. COM-29 (1981) 392\u2013398.","journal-title":"IEEE Trans. Commun."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02094337.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02094337\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02094337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T10:54:59Z","timestamp":1586429699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02094337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF02094337"],"URL":"https:\/\/doi.org\/10.1007\/bf02094337","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}