{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:27:30Z","timestamp":1648538850139},"reference-count":65,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0140-3664(88)90039-4","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T18:34:07Z","timestamp":1060281247000},"page":"281-287","source":"Crossref","is-referenced-by-count":2,"title":["Communication network optimization"],"prefix":"10.1016","volume":"11","author":[{"given":"VM","family":"Grout","sequence":"first","affiliation":[]},{"given":"PW","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB1","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1109\/TCOM.1972.1091160","article-title":"Optimizing the reliability in centralized computer networks","volume":"Vol COM-20","author":"Hansler","year":"1972","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230010307","article-title":"Network reliability analysis: part 1","volume":"Vol 1","author":"Van Slyke","year":"1972","journal-title":"Networks"},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB3","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TCOM.1972.1091214","article-title":"Analysis and design of reliable computer networks","volume":"Vol COM-20","author":"Wilkov","year":"1972","journal-title":"IEEE Trans. Commun."},{"issue":"No 7","key":"10.1016\/0140-3664(88)90039-4_BIB4","first-page":"323","article-title":"Optimum grade of service in telecommunication networks","volume":"Vol 51","author":"Gunnarsson","year":"1984","journal-title":"Telecommun. J."},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB5","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/TCOM.1972.1091198","article-title":"The control of congestion in packet-switching networks","volume":"Vol COM-20","author":"Davies","year":"1972","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB6","series-title":"Graph Theory","author":"Harary","year":"1971"},{"key":"10.1016\/0140-3664(88)90039-4_BIB7","series-title":"Introduction to Graph Theory","author":"Wilson","year":"1972"},{"key":"10.1016\/0140-3664(88)90039-4_BIB8","first-page":"94","article-title":"Graph theory and the telecommunications network","author":"Cattermole","year":"1975","journal-title":"IMA Bulletin"},{"key":"10.1016\/0140-3664(88)90039-4_BIB9","article-title":"Optimisation Techniques for Telecommunication Networks","author":"Grout","year":"1988"},{"key":"10.1016\/0140-3664(88)90039-4_BIB10","series-title":"Telecommunication Switching Principles","author":"Hills","year":"1979"},{"issue":"No 1","key":"10.1016\/0140-3664(88)90039-4_BIB11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TCOM.1972.1091110","article-title":"On the optimization of message-switching networks","volume":"Vol COM-20","author":"Meister","year":"1972","journal-title":"IEEE Trans. Commun."},{"issue":"No 2","key":"10.1016\/0140-3664(88)90039-4_BIB12","first-page":"94","article-title":"Planning of exchange locations and boundaries in multi-exchange networks","author":"Rapp","year":"1962","journal-title":"Ericsson Tech."},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB13","first-page":"196","article-title":"Computer aids to network planning: placement of telephone exchanges in urban areas","volume":"Vol 46","author":"Enriquez de Salamanca","year":"1971","journal-title":"Electr. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB14","first-page":"15","article-title":"Local network optimization","volume":"Vol 29-1","author":"Wadhwa","year":"1979","journal-title":"Telecommun."},{"issue":"No 66","key":"10.1016\/0140-3664(88)90039-4_BIB15","first-page":"7","article-title":"Planning digital exchange locations and boundaries in urban area","author":"Okazaki","year":"1982","journal-title":"NEC Res. & Dev."},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TCOM.1985.1096278","article-title":"Local network area size optimization","volume":"Vol COM-33","author":"Hoshi","year":"1985","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB17","series-title":"Proc. Symposium on Comput. Commun. Networks & Teletraffic","first-page":"355","article-title":"Optimization of concentrator locations intteleprocessing networks","author":"Bahl","year":"1972"},{"issue":"No 1","key":"10.1016\/0140-3664(88)90039-4_BIB18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","article-title":"Large-scale network topological optimization","volume":"Vol COM-25","author":"Boorstyn","year":"1977","journal-title":"IEEE Trans. Commun."},{"issue":"No 7","key":"10.1016\/0140-3664(88)90039-4_BIB19","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TC.1978.1675159","article-title":"Optimization of teleprocessing networks with concentrators and multiconnected terminals","volume":"Vol C-27","author":"Tang","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"No 1","key":"10.1016\/0140-3664(88)90039-4_BIB20","first-page":"164","article-title":"Topological optimization of networks: a non-linear mixed integer model employing generalized Benders decomposition","volume":"Vol AC-27","author":"Hoc","year":"1982","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/0140-3664(88)90039-4_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230150102","article-title":"Lagrangian relaxation for the star-star concentrator location problem: approximation algorithm and bounds","volume":"Vol 15","author":"Mirzaian","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0140-3664(88)90039-4_BIB22","series-title":"Proc. IMA Conf. on Simulation and Optimisation of Large Systems","article-title":"Large scale telecommunication network optimisation","author":"Grout","year":"1986"},{"issue":"No 1","key":"10.1016\/0140-3664(88)90039-4_BIB23","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0140-3664(87)90312-4","article-title":"Practical approach to the optimization of large-scale switching networks","volume":"Vol 10","author":"Grout","year":"1987","journal-title":"Comput. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB24","year":"1984","journal-title":"BP Report No TEL 00184"},{"key":"10.1016\/0140-3664(88)90039-4_BIB25","series-title":"Proc. IMA Conf. Simulation and Optimisation of Large Systems","article-title":"The provision of high performance computing","author":"Sumner","year":"1986"},{"issue":"No 10","key":"10.1016\/0140-3664(88)90039-4_BIB26","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/T-C.1972.223452","article-title":"The design of multipoint linkages in a teleprocessing tree network","volume":"Vol C-21","author":"Chandy","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0140-3664(88)90039-4_BIB27","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"Vol 7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0140-3664(88)90039-4_BIB28","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"Vol 36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J"},{"key":"10.1016\/0140-3664(88)90039-4_BIB29","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0140-3664(88)90039-4_BIB30","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the travelling salesman problem","volume":"Vol 11","author":"Little","year":"1963","journal-title":"Oper. Res."},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB31","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","article-title":"On teleprocessing system design: part II: a method for approximating the optimal network","volume":"Vol 5","author":"Esau","year":"1966","journal-title":"IBM Syst. J."},{"issue":"No 11","key":"10.1016\/0140-3664(88)90039-4_BIB32","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TCOM.1974.1092123","article-title":"A unified algorithm for designing multidrop teleprocessing networks","volume":"Vol COM-22","author":"Kershenbaum","year":"1974","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/net.3230010105","article-title":"Optimal design of centralized computer networks","volume":"Vol 1","author":"Frank","year":"1971","journal-title":"Networks"},{"issue":"No 11","key":"10.1016\/0140-3664(88)90039-4_BIB34","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TCOM.1974.1092122","article-title":"Topological design of teleprocessing networks","volume":"Vol COM-22","author":"Elias","year":"1974","journal-title":"IEEE Trans. Commun."},{"issue":"No 5","key":"10.1016\/0140-3664(88)90039-4_BIB35","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","article-title":"A new class of algorithms for multipoint network optimization","volume":"Vol COM-24","author":"Karnaugh","year":"1976","journal-title":"IEEE Trans. Commun."},{"issue":"No 10","key":"10.1016\/0140-3664(88)90039-4_BIB36","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","article-title":"Second order greedy algorithms for centralized teleprocessing network design","volume":"Vol COM-28","author":"Kershenbaum","year":"1980","journal-title":"IEEE Trans. Commun."},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB37","first-page":"202","article-title":"National trunking network optimization","volume":"Vol 46","author":"Gallego","year":"1971","journal-title":"Electr. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB38","first-page":"1385","article-title":"Topological optimization of computer networks","volume":"Vol 60","author":"Frank","year":"1972"},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB39","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/TCT.1973.1083655","article-title":"Design of long distance telecommunication networks \u2014 the Telpak problem","volume":"Vol CT-20","author":"Goldstein","year":"1973","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"No 11","key":"10.1016\/0140-3664(88)90039-4_BIB40","first-page":"689","article-title":"International network optimization methods","volume":"Vol 46","author":"Engvall","year":"1979","journal-title":"Telecommun. J."},{"key":"10.1016\/0140-3664(88)90039-4_BIB41","first-page":"47","article-title":"COST 201 \u2014 a procedure for the optimisation of telecommunication networks","volume":"Vol 3","author":"Greenhop","year":"1984","journal-title":"Br. Telecommun. Eng."},{"key":"10.1016\/0140-3664(88)90039-4_BIB42","series-title":"Proc. AFIPS Spring Joint Comput. Conf.","first-page":"581","article-title":"Topological considerations in the design of the ARPA computer network","author":"Frank","year":"1970"},{"issue":"No 3","key":"10.1016\/0140-3664(88)90039-4_BIB43","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1109\/TCOM.1972.1091204","article-title":"Performance measurements on the ARPA computer network","volume":"Vol COM-20","author":"Cole","year":"1972","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB44","series-title":"Proc. AFIPS Spring Joint Comput. Conf.","first-page":"255","article-title":"Computer communication network design \u2014 experience with theory and practice","author":"Frank","year":"1972"},{"key":"10.1016\/0140-3664(88)90039-4_BIB45","series-title":"Computer Communication Network","author":"Schwartz","year":"1977"},{"key":"10.1016\/0140-3664(88)90039-4_BIB46","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"Vol 4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0140-3664(88)90039-4_BIB47","series-title":"Network flow theory","author":"Ford","year":"1956"},{"key":"10.1016\/0140-3664(88)90039-4_BIB48","first-page":"551","article-title":"On the problem of shortest paths between points, I and II","volume":"Vol 59","author":"Heller","year":"1953","journal-title":"Bull. American Math. Soc."},{"key":"10.1016\/0140-3664(88)90039-4_BIB49","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"Two problems in connexion with graphs","volume":"Vol 1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"No 6","key":"10.1016\/0140-3664(88)90039-4_BIB50","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1287\/opre.24.6.1164","article-title":"Shortest path algorithms: a comparison","volume":"Vol 24","author":"Golden","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/0140-3664(88)90039-4_BIB51","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"Vol 16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math"},{"key":"10.1016\/0140-3664(88)90039-4_BIB52","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.3230080404","article-title":"Shortest paths with Euclidean distances: an explanatory model","volume":"Vol 8","author":"Golden","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0140-3664(88)90039-4_BIB53","doi-asserted-by":"crossref","unstructured":"Verblunsky, S \u2018On the shortest path through a number of points\u2019 Proc. American Math. Soc. Vol 2 No 6 pp 904\u2013913","DOI":"10.1090\/S0002-9939-1951-0045403-1"},{"key":"10.1016\/0140-3664(88)90039-4_BIB54","first-page":"299","article-title":"The shortest path through many points","volume":"Vol 55","author":"Beardwood","year":"1959"},{"key":"10.1016\/0140-3664(88)90039-4_BIB55","series-title":"The travelling salesman problem","author":"Lawler","year":"1985"},{"key":"10.1016\/0140-3664(88)90039-4_BIB56","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur Allgemeinen kurventheorie","volume":"Vol 10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/0140-3664(88)90039-4_BIB57","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"Vol 8","author":"Ford","year":"1956","journal-title":"Can. J. Math."},{"key":"10.1016\/0140-3664(88)90039-4_BIB58","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","article-title":"The complexity of finding maximum disjoint paths with length constraints","volume":"Vol 12","author":"Ital","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0140-3664(88)90039-4_BIB59","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230140405","article-title":"Heuristics for finding a maximum number of disjoint bounded paths","volume":"Vol 14","author":"Ronen","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0140-3664(88)90039-4_BIB60","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230010202","article-title":"Routing in computer networks","volume":"Vol 1","author":"Frank","year":"1971","journal-title":"Networks"},{"issue":"No 1","key":"10.1016\/0140-3664(88)90039-4_BIB61","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","article-title":"A minimum delay routing algorithm using distributed computation","volume":"Vol COM-25","author":"Gallager","year":"1977","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0140-3664(88)90039-4_BIB62","first-page":"751","article-title":"Distributed routing algorithm for a circuit switched packet switching network","volume":"Vol 131","author":"Yu","year":"1984"},{"issue":"No 9","key":"10.1016\/0140-3664(88)90039-4_BIB63","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TC.1985.1676633","article-title":"Fault tolerant routing in DeBruijn communication networks","volume":"Vol C-34","author":"Esfahanian","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0140-3664(88)90039-4_BIB64","series-title":"Proc. 1st IEE National Conf. on UK Telecommun. Networks \u2014 Present and Future","first-page":"78","article-title":"Routing, flow control and learning algorithms","author":"Mars","year":"1987"},{"key":"10.1016\/0140-3664(88)90039-4_BIB65","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01609034","article-title":"Testing of a large scale network optimization program","volume":"Vol 15","author":"Mulvey","year":"1978","journal-title":"Math. Programming"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0140366488900394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0140366488900394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:23:47Z","timestamp":1552623827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0140366488900394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":65,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0140366488900394"],"URL":"https:\/\/doi.org\/10.1016\/0140-3664(88)90039-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}