{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:43Z","timestamp":1738387843405,"version":"3.35.0"},"reference-count":217,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":5855,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1992,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the planning of circuit\u2010switched networks the decisions regarding the capacity of transmission and switching equipments, the location of exchanges and the routing principles are of primary importance. Traditionally planning methods were based on heuristic type algorithms using sometimes simple mathematical programming algorithms for particular sub\u2010problems. However in the 70's and 80's, new approaches based on mathematical programming algorithms (namely non\u2010linear programming, integer programming and dynamic programming algorithms) have been put forward for solving some key telecommunication network planning problems.<\/jats:p><jats:p>The main objective of the paper is to identify the main characteristics of problems where mathematical programming has been applied (in the context of circuit\u2010switched network planning) and referring to relevant works in these areas. A system of taxonomic classification of circuit\u2010switched network planning problems is proposed and applied to an extensive list of relevant publications complemented with a list of correlated papers and other publications. The core of the overview of contributions, presented in the paper, will be limited to models of operational planning of circuit\u2010switched networks. Finally the authors, based on their own experience in specific problems, will try to put forward some general conclusions of a broad methodological nature.<\/jats:p>","DOI":"10.1002\/ett.4460030511","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:59:20Z","timestamp":1221220760000},"page":"499-515","source":"Crossref","is-referenced-by-count":1,"title":["A survey of applications of mathematical programming to circuit\u2010switched network planning problems"],"prefix":"10.1002","volume":"3","author":[{"given":"Jos\u00e9","family":"Craveirinha","sequence":"first","affiliation":[]},{"given":"Jo\u00f3","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"volume-title":"Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints","year":"1969","author":"Abadie J.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.478"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.493"},{"volume-title":"Design and analysis of computer communication networks","year":"1982","author":"Ahuja V.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.331"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.4.501"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1002\/j.1538-7305.1981.tb00297.x","article-title":"Design and Optimization of Networks with dynamic routing","volume":"60","author":"Ash G. R.","year":"1981","journal-title":"Bell System Tech. Journal"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1002\/j.1538-7305.1981.tb00297.x","article-title":"Design and Optimization of networks witrh dynamic routing","volume":"66","author":"Ash G. R.","year":"1981","journal-title":"Bell Systems Technical J."},{"volume-title":"Computer algorithms: Introduction to design and analysis","year":"1983","author":"Baase S.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","unstructured":"BahlL.andTangD. \u201cOptimization of concentrator locations in teleprocessing networks\u201d Proc. Symp. on Computer comm. and telegraphy New York1972."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1057\/jors.1984.167","article-title":"A network\u2010flow algorithm for project selection","volume":"35","author":"Baker B. M.","year":"1984","journal-title":"Journal of the Operations Research Society"},{"key":"e_1_2_1_13_1","unstructured":"BandeiraP. L. \u201cDesenho topol\u00f3gico de redes de comunica\u00e7\u00e3o de dados de comuta\u00e7\u00e3o de pacotes em malha\u201d 2\u2033 Workshop nacional sobre tecnologias de comunica\u00e7\u00e3s (in Portuguese)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"BARCEL\u00d3J. andCasanovasJ. \u201cA heuristic lagrangean algorithm for the capacitated plant location problem\u201d European Journal of Operations Research 1984 pp.212\u2013226.","DOI":"10.1016\/0377-2217(84)90211-X"},{"key":"e_1_2_1_15_1","unstructured":"Baybards I. K. O;Kortanek;Lee D. N.;Polak \u201cHierarchical Network design for facilities planning: A 24\u2010node example\u201d Proc. 13th Annual Conference on Modelling and Simulation pp.22\u201323 April1982."},{"key":"e_1_2_1_16_1","unstructured":"Baybars K. O;Kortanek;Mizuno N. \u201cA mixed\u2010integer programming model for transmission system planning in telecommunications networks with general circuit requirements\u201d Proc. 11th. Annual Conference on Modelling and simulation University of Pittsburgh P A pp395\u2013402 May1980."},{"key":"e_1_2_1_17_1","first-page":"267","article-title":"Adaptative Traffic Routing in Telephone Networks","volume":"8","author":"Bel G","year":"1985","journal-title":"Large Scale Systems Journal"},{"volume-title":"Graphs and hipergraphs","year":"1973","author":"Berge C.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096159"},{"issue":"12","key":"e_1_2_1_20_1","doi-asserted-by":"crossref","DOI":"10.1109\/TAC.1983.1103183","article-title":"Projected Newton Methods and Optimization of Multicommodity Flows","volume":"28","author":"Bertsekas D. P","year":"1983","journal-title":"I.E.E.E. Trans on Automatic Control"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096159"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110106"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","article-title":"Large\u2010scale network topological optimization","volume":"25","author":"Boorstyn R.","year":"1977","journal-title":"IEEE, Trans, on comm."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140111"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120697"},{"key":"e_1_2_1_26_1","unstructured":"Camerini P. M. Maffioli andC.Vercellis; \u201cMulti\u2010constrained matroidal Knapsack problem mathematical Programming Studies(to appear)."},{"issue":"10","key":"e_1_2_1_27_1","first-page":"1062","article-title":"Optimal routing in a packet\u2010switched computer network","volume":"23","author":"Cantor D. G.","year":"1974","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_28_1","article-title":"Design and Testing of a Generalized Reduced Gradient Code for Nonliniear Programming","volume":"4","author":"Casdon L.","year":"1978","journal-title":"ACM Trans, on Mathematical Software"},{"key":"e_1_2_1_29_1","unstructured":"CCITT \u201cGeneral Network Planning\u201d (GAS\u20103) Geneva. ISBN 92\u201061\u201001761\u20104 1983."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030204"},{"issue":"10","key":"e_1_2_1_31_1","first-page":"1062","article-title":"The design of multipoint linkages in a teleprocessing tree network","volume":"21","author":"Chandy K.","year":"1972","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0169-7552(86)90052-8","article-title":"Grade of service and optimization of distributed packet\u2010swithched networks","volume":"11","author":"Chardaire P.","year":"1986","journal-title":"Computer Networks and ISDN Systems"},{"key":"e_1_2_1_33_1","unstructured":"Chou F;Ferrante F;Balagangaadhar M. \u201cIntegrated Optimization of distributed processing networks\u201d in Proc. Nat. Compute. Conf. pp.795\u2013811."},{"key":"e_1_2_1_34_1","unstructured":"Chou F;Ferrante F;Balagangaadhar M;Gerke L. \u201cAn algorithm for Optimally Locating Network Access Facilities\u201d."},{"volume-title":"Graph theory","year":"1975","author":"Christofides N.","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(82)90205-3"},{"volume-title":"Location of bank accounts to optimize float: an analytic study of exact and approximative algorithms","year":"1977","author":"Cornuejols G.","key":"e_1_2_1_37_1"},{"volume-title":"Computer network and their protocol","year":"1979","author":"Davies D. W.","key":"e_1_2_1_38_1"},{"issue":"6","key":"e_1_2_1_39_1","doi-asserted-by":"crossref","DOI":"10.1287\/opre.19.6.1406","article-title":"An all zero\u2010one algorithm for a certain class of transportation problems","volume":"19","author":"DE\u2010MAIO A","year":"1971","journal-title":"Oper. Res."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"DukstraE. W. \u201cA note on two problems in concession with graphs\u201d Numer. Math. Oct.1959 pp.269\u2013271.","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090104"},{"issue":"10","key":"e_1_2_1_42_1","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/TCOM.1976.1093220","article-title":"Topological design of teleprocessing networks using linear regression clustering","volume":"24","author":"Dirilten H.","year":"1976","journal-title":"IEEE Trans on comm."},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TCOM.1971.1090645","article-title":"Topology and transmission rate considerations in the design of centralized computer communication networks","volume":"19","author":"Doll D.","year":"1971","journal-title":"IEEE Trans, on comm. tech."},{"issue":"4","key":"e_1_2_1_44_1","first-page":"811","article-title":"Optimal Network Capacity Planning: A Shortest Path Scheme","volume":"23","author":"Douillez P. J.","year":"1975","journal-title":"Operations Research"},{"key":"e_1_2_1_45_1","first-page":"365","article-title":"An appraisal of some shortest paths algorithms","volume":"17","author":"Dreyfus S. E.","year":"1969","journal-title":"Journal of the operations research society of America"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Dutta A.;Koehler G;Whinston \u201cAn optimal allocation in a distributed processing environment\u201d Managmt. Sci. No. 28; pp.839\u2013853.","DOI":"10.1287\/mnsc.28.8.839"},{"issue":"1","key":"e_1_2_1_47_1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TCOM.1978.1093947","article-title":"Newclust: an algorithm for the topological design of two level multidrop teleprocessing network","volume":"26","author":"Dysart H. G.","year":"1978","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_48_1","unstructured":"EfroymsonM.andRayT. \u201cA branch and bound algorithm for plant location\u201d Operational Research1966."},{"issue":"11","key":"e_1_2_1_49_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1974.1092122","article-title":"Topological design of multipoint teleprocessing networks","volume":"22","author":"Elias D.","year":"1974","journal-title":"IEEE Trans, on comm."},{"issue":"1","key":"e_1_2_1_50_1","article-title":"The Law of economies of Scale applied to Telecommunications System design","volume":"50","author":"Ellis L. W.","year":"1975","journal-title":"Electrical Communication"},{"key":"e_1_2_1_51_1","unstructured":"Ericsson L. M. Telephone Exchange Division.\u201d Network planning Research carried out by YNGVE RAPP: A summary\u201d Stockholm."},{"key":"e_1_2_1_52_1","first-page":"670","article-title":"A method for approximating continuous economies of scale","volume":"12","author":"Esau L. R.","year":"1966","journal-title":"Management Science"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Esau L. R.;Williams K. C.; \u201cA method of approximating theoptimal network\u201d IBM Syst.J. No. 5 pp.142\u2013147 1966.","DOI":"10.1147\/sj.53.0142"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230140211","article-title":"On computing the connectivities of graphs and digraphs","volume":"14","author":"Esfahanian A. M.","journal-title":"Networks"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204034"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","DOI":"10.1287\/opre.11.3.399","article-title":"Generalized Lagrange multipliers method for solving problems of optimal allocation of resources","author":"Everett H.","year":"1963","journal-title":"Operations Research"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.12.9.670"},{"key":"e_1_2_1_58_1","first-page":"1","article-title":"The lagrangean relaxation method for solving integer programming problems","volume":"17","author":"Fisher M. L.","year":"1981","journal-title":"Manag. Sci."},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Fisher M. L.;Hochbaum D. S. \u201cData base location in computer networks\u201d J. Ass. Compute. Mach. no. 27 pp.718\u2013735 1980.","DOI":"10.1145\/322217.322226"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1972.8910"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"FrankH. FrichI. T. andChouW. \u201cTopological considerations in the design of the ARPA computer network\u201d proc. SJCC1970 pp.581\u2013587.","DOI":"10.1145\/1476936.1477023"},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"FrankM. WolfeP. \u201cAn Algorithm for Quadratic Programming\u201d Nav. Res. Log. Quart. pp95\u2013110 1956.","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030202"},{"volume-title":"A Capacity Expansion, Analysis of Simple Models with Applications","year":"1981","author":"Freidendelds J.","key":"e_1_2_1_65_1"},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","DOI":"10.1287\/opre.27.3.567","article-title":"A heuristic branch\u2010and\u2010bound algorithm for the telephone feeder capacity expansion","volume":"27","author":"Freidenfelds J.","year":"1979","journal-title":"Operations Research"},{"key":"e_1_2_1_67_1","first-page":"73","article-title":"A good algorithm for smallest spanning trees with a degree constraint","volume":"25","author":"Gabow H. N.","year":"1977","journal-title":"NETWORKS"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"e_1_2_1_69_1","unstructured":"Garcia J. M. \u201cProblems li\u00e9s \u00e0 la mod\u00e9lisation du traffic et \u00e0 I'acheminent des appels dans un r\u00e9seau t\u00e9l\u00e9phonique.\u201d Docteur\u2010lng\u00e9nieur\u201d Thesis Univ. Paul Sabatier Toulouse 1980."},{"key":"e_1_2_1_70_1","unstructured":"Gavish B. \u201cA general model for the topological design of computer networks\u201d in Proc. GLOBCOM'86 pp.1584\u20131588 1986."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322367"},{"key":"e_1_2_1_72_1","doi-asserted-by":"crossref","unstructured":"Gavish B.; \u201cModels for configuring large scale distributed computing systems\u201d AT & T Technical Journal No. 64 pp.491\u2013532 1985.","DOI":"10.1002\/j.1538-7305.1985.tb00360.x"},{"key":"e_1_2_1_73_1","unstructured":"Gavish B.; \u201cNew Algorithms for the Capacitated minimal directed tree problem\u201d Proc. ICCC 88 Port Chester NY pp.996\u20131000 1980."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120402"},{"key":"e_1_2_1_75_1","unstructured":"Gavish B. Altinkemer K. \u201cA parallel savings heuristic for the topological design of local access tree networks\u201d in proc. IEEE INFOCOM 86 Miami Fh pp.130\u2013147 1986."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.20116"},{"key":"e_1_2_1_77_1","unstructured":"Gavish B;Neuman I. \u201cCapacity and flow assignment in large computer networks\u201d in Proc. IEEE INFOCOM 86 Miami pp.275\u2013284 1986."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676799"},{"key":"e_1_2_1_79_1","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","article-title":"An algorithm for optimal route selection in SNA networks","volume":"3","author":"Gavish B.","year":"1983","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_80_1","doi-asserted-by":"crossref","unstructured":"GelfandS. B. MitterK. B. \u201cAnalysis of Simulated Annealing for Optimization\u201d IEEE Conf. on Decision and Control Vol 2 Florida.1985.","DOI":"10.1109\/CDC.1985.268603"},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","unstructured":"GeoffrionA. \u201cLagrangean relaxation for integer programming\u201d. Mathematical Programming Study 2. pp.82\u2013114 Dec.1974.","DOI":"10.1007\/BFb0120690"},{"key":"e_1_2_1_82_1","first-page":"40","article-title":"Lagrangian Relaxation Applied to capacitated facility location problems","volume":"10","author":"Geoffrion A. M","year":"1978","journal-title":"AI1E Trans."},{"key":"e_1_2_1_83_1","doi-asserted-by":"crossref","unstructured":"GerlaM. \u201cDeterministic and adaptative routing policies in packet\u2010switched computer networks\u201d. ACM\u2010IEEE. 3rd. Data Common. Symp. Tampa Nov.1973","DOI":"10.1145\/800280.811026"},{"key":"e_1_2_1_84_1","unstructured":"GerlaM. \u201cThe design of store\u2010and\u2010forward networks for computer communications\u201d. Ph.D. Dissertation School of Eng. and Appl.Sci. Univ. of California Los Angeles Jan.1973."},{"issue":"1","key":"e_1_2_1_85_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1977.1093709","article-title":"On the Topological Design of Distributed Computer Networks","volume":"25","author":"Gerla M.","year":"1977","journal-title":"I.E.E.E. Trans, on Communications"},{"key":"e_1_2_1_86_1","unstructured":"GerlaM. FrankH. ChouW.andEcklJ. \u201cA cut saturation algorithm for topological design of packet switched communication network\u201d Proceedings of the IEEE National Telecommunications Conference San Diego December1974 pp.1074\u20131085."},{"key":"e_1_2_1_87_1","article-title":"Lagrangean relaxation applied to capacitated facility location problem","volume":"10","author":"Geoffrion A.","journal-title":"IEEE Transactions"},{"key":"e_1_2_1_88_1","doi-asserted-by":"crossref","unstructured":"GershetA. WeihmayerR. \u201cCombinatorial Optimization Model for Joint Network Design and Facility Selection\u201d Globecom'87 Nov.1987.","DOI":"10.1109\/CDC.1987.272892"},{"key":"e_1_2_1_89_1","doi-asserted-by":"crossref","unstructured":"GidasB. \u201cGlobal Optimization via the Langevin Equation\u201d the 24th IEEE Conf. on Decision and Control Vol. 2 Florida 1985.","DOI":"10.1109\/CDC.1985.268602"},{"key":"e_1_2_1_90_1","doi-asserted-by":"crossref","unstructured":"Gomory R. J.;Hu T. C.; \u201cMulti\u2010Terminal Network Flows\u201d J. Soc. Indust. Appl. Math. No 9 (4) 1961.","DOI":"10.1137\/0109047"},{"volume-title":"Graphs and algorithms","year":"1984","author":"Gondran M.","key":"e_1_2_1_91_1"},{"issue":"5","key":"e_1_2_1_92_1","article-title":"A Branch Search Algorithm for KnapSack Problems","volume":"16","author":"Greeberg H","year":"1970","journal-title":"Manag. Science"},{"key":"e_1_2_1_93_1","first-page":"189","article-title":"Resources constrained modernization planning (RECOMP)","volume":"1","author":"Gupta V. P.","year":"1984","journal-title":"ICC '84"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.1985.1092435"},{"key":"e_1_2_1_95_1","doi-asserted-by":"crossref","unstructured":"Hajek B. \u201cA Tutorial survey of theory and applications of SIMULATED ANNEALING\u201d the 24th IEEE Conf. on Decision and Control Vol.2 Florida 1985.","DOI":"10.1109\/CDC.1985.268599"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140308"},{"key":"e_1_2_1_97_1","doi-asserted-by":"crossref","unstructured":"Hakimi S. L. \u201cAn algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity\u201d IEEE Trans circuit theory May1969 pp.229\u2013230.","DOI":"10.1109\/TCT.1969.1082940"},{"key":"e_1_2_1_98_1","doi-asserted-by":"crossref","unstructured":"HakimiS. L. andAminA. T. \u201cOn the design of reliable networks\u201d NETWORKS No. 3.1973 pp.241\u2013260.","DOI":"10.1002\/net.3230030304"},{"key":"e_1_2_1_99_1","unstructured":"Helme M. P.; \u201cSome Mathematical Methods for Distribution Systems Modelling\u201d GTE Labs TN84\u2010423 1 1984."},{"key":"e_1_2_1_100_1","unstructured":"Hitchner L. E. \u201cA Comparative investigation of the computational efficiency of shortest path algorithms\u201d ORC 68\u201025 Operations Research Center University of California Berkeley Nov.1968."},{"volume-title":"Combinatorial Algorithms","year":"1982","author":"Hu T. C.","key":"e_1_2_1_101_1"},{"issue":"1","key":"e_1_2_1_102_1","article-title":"Optimal design of mixed\u2010media packet\u2010switching networks routing and capacity assignment","volume":"25","author":"Huynh D.","year":"1977","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_103_1","unstructured":"Ishizaki Y;Yoshida N.;Sasabe S.;Ishiyama Y. \u201cMulti\u2010commodity flow approach to assignment of circuits in case of failure in a communication network\u201d IX Int. Conference on Mathematical Programming in Budapeste Hungary 23\u201327 Aug. 1976."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120306"},{"key":"e_1_2_1_105_1","series-title":"EE Publ. 358","volume-title":"A maximal How approach to dynamic routing in communications networks","author":"Jodorkovsky M","year":"1979"},{"issue":"5","key":"e_1_2_1_106_1","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TCOM.1976.1093334","article-title":"A new class of algorithms for multpoint network optimization","volume":"24","author":"Karnaugh M.","year":"1976","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_107_1","unstructured":"KarnaughM. \u201cMultipoint network layout program\u201d IBM Res. Rep. Re 3723. Fev.1972."},{"key":"e_1_2_1_108_1","unstructured":"KershenbaumA. \u201cCentralized teleprocessing network design\u201d. Ph.D. Thesis. Polytechnic Institute of New York.1976."},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040403"},{"issue":"10","key":"e_1_2_1_110_1","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","article-title":"Second\u2010order greedy algorithms for centralized network design","volume":"28","author":"Kershenbaum A.","year":"1980","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130211"},{"issue":"10","key":"e_1_2_1_112_1","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","article-title":"Second\u2010order greedy algorithms for centralized network design","volume":"28","author":"Kershenbaum A.","year":"1980","journal-title":"IEEE Trans, on comm."},{"issue":"11","key":"e_1_2_1_113_1","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/TCOM.1974.1092123","article-title":"A unified algorithm for designing teleprocessing networks","volume":"22","author":"Kershenbaum A.","year":"1974","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_114_1","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/mnsc.18.12.B718","article-title":"Warehouse location problems, efficient branch\u2010and\u2010bound algorithm","volume":"18","author":"Khumawala B.","journal-title":"Mang. Sci."},{"key":"e_1_2_1_115_1","doi-asserted-by":"crossref","unstructured":"Khumawala B. M. \u201cAn efficient branch and bound algorithm for the warehouse location problem\u201d Manag. Science Aug.1972.","DOI":"10.1287\/mnsc.18.12.B718"},{"key":"e_1_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1969.1082941"},{"volume-title":"Communications nets","year":"1964","author":"Kleinrock L.","key":"e_1_2_1_117_1"},{"volume-title":"Queueing systems; vol.2: computer applications","year":"1976","author":"Kleinrock L.","key":"e_1_2_1_118_1"},{"key":"e_1_2_1_119_1","doi-asserted-by":"crossref","unstructured":"Kleinrock L;Kamoun F. \u201cHierarchical Routing for Large Scale Networks\u201d Computer Networks No. 1 pp.155\u2013174 1977.","DOI":"10.1016\/0376-5075(77)90002-2"},{"key":"e_1_2_1_120_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230100305","article-title":"Optimal clustering Structures for Hierarchical Topological Design of large Scale Computer Networks","volume":"1","author":"Kleinrock L","year":"1980","journal-title":"Networks"},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040406"},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1986.84"},{"key":"e_1_2_1_123_1","doi-asserted-by":"crossref","unstructured":"Klincewicz John.;Luss H. \u201cA large\u2010sacle multilocation capacity planning model\u201d European Journal. Operat Res. No 34 pp.178\u2013190 1988.","DOI":"10.1016\/0377-2217(88)90353-0"},{"key":"e_1_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800280102"},{"issue":"1","key":"e_1_2_1_125_1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","article-title":"The simple plant location problem: survey and synthesis","volume":"12","author":"Kramp J.","year":"1983","journal-title":"European Journal of Operations Research"},{"key":"e_1_2_1_126_1","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"17","author":"Kruskal J. B.","year":"1956","journal-title":"Proc. Amer. Math. Sco."},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.643"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1145\/355769.355773"},{"key":"e_1_2_1_129_1","series-title":"Series in Operations Research","volume-title":"Optimization Theory for Large Scale Systems","author":"Lasdon L.","year":"1980"},{"issue":"1","key":"e_1_2_1_130_1","doi-asserted-by":"crossref","DOI":"10.1145\/355769.355773","article-title":"Design and Testing of a Generalized Reduced Gradient Code For Nonlinear Programming","volume":"4","author":"Lasdon L.","year":"1978","journal-title":"ACM Trans, on Mathematical Software"},{"key":"e_1_2_1_131_1","unstructured":"LaviaA.andManningE. G. \u201cPertubation techniques for topological optimization of computers networks\u201d Proc. Fourth Data Comm. Symp.1975 pp.4\u201323."},{"volume-title":"Combinatorial Optimization: Networks and Matroids","year":"1976","author":"Lawler E. L.","key":"e_1_2_1_132_1"},{"issue":"1","key":"e_1_2_1_133_1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"LE GALL F.","year":"1986","journal-title":"Mathematical programming"},{"key":"e_1_2_1_134_1","unstructured":"Lehtinen Pekka \u201cNetwork flow model of a communication network for optimal design and routing\u201d Proc. International Symposium on Network Planning: Networks 80 Session pp.124\u2013129 Paris 1980."},{"key":"e_1_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.972"},{"key":"e_1_2_1_136_1","unstructured":"Lo C. C.;Kershenbaum \u201cA Two\u2010phase algorithm for the star\u2010star concentrator location problem\u201d INFOCOM'88 New Orleans LA March 1988."},{"issue":"11","key":"e_1_2_1_137_1","article-title":"A Two\u2010phase Algorithm and Performance Bounds for the Star\u2010Star Concentrator Location Problem","volume":"37","author":"Lo C. C","year":"1989","journal-title":"IEEE Trans, on Communications"},{"key":"e_1_2_1_138_1","unstructured":"LOUREN\u00c7O HelenaR. \u201cAlgoritmos para o Projecto de Redes de Comunica\u00e7\u00e3o de Dados\u201d. Research Report DEIOC Fac. Ci\u011bncias Univ. Lisboa.1988 (in Portuguese)."},{"key":"e_1_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582166"},{"volume-title":"A Capacity Expansion Model with Application to Multiplexing in Communications Networks","year":"1982","author":"Luss H.","key":"e_1_2_1_140_1"},{"key":"e_1_2_1_141_1","unstructured":"Luss H. \u201cA Multifacility Capacity Expansion Model with Joint Expansion Set\u2010up costs\u201d. In 5th European Congress on Operational Research and 25th Meeting TIMS Lausanne 1982."},{"issue":"5","key":"e_1_2_1_142_1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.30.5.907","article-title":"Operations Research and Capacity Expansion Problems: A Survey","volume":"30","author":"Luss H.","year":"1982","journal-title":"Operation Research"},{"issue":"1","key":"e_1_2_1_143_1","article-title":"Network design and transportation models and algorithms","volume":"18","author":"Magnanti T. L.","year":"1984","journal-title":"Operations Research Society of America"},{"volume-title":"System analysis for data transmission","year":"1972","author":"Martin J.","key":"e_1_2_1_144_1"},{"key":"e_1_2_1_145_1","first-page":"399","article-title":"On a special class of bicriterion path problems","volume":"11","author":"Martins E.","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"e_1_2_1_146_1","unstructured":"MartinsE. \u201cSobre quatro problemas do melhor caminho\u201d Departamento de Matem\u00e1tica da Universidade de Coimbra (in Portuguese)."},{"key":"e_1_2_1_147_1","first-page":"399","article-title":"On a special class of bicriterion path problems","volume":"11","author":"Martins E.","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"e_1_2_1_148_1","doi-asserted-by":"crossref","unstructured":"Maruyama K;Fratta K;TangD. \u201cHeuristic Design algorithm for computer communications networks with different classes of customers\u201d IBM J. Res. Develop. pp.360\u2013369 1977.","DOI":"10.1147\/rd.214.0360"},{"key":"e_1_2_1_149_1","unstructured":"MaruyamaK.andTangD. T. \u201cDiscrete link capacity assignment in communication networks\u201d Proceedings of the third International Conference of Computer Communication August1976 pp.92\u201397."},{"key":"e_1_2_1_150_1","article-title":"Equilibrium flows, routing patterns and algorithms for store\u2010and\u2010forward networks","volume":"8","author":"Mason L. G.","year":"1985","journal-title":"Large Scale Systems"},{"key":"e_1_2_1_151_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230070102","article-title":"A Generalized Upper Bounding Approach to a Communication Network Planning","volume":"7","author":"Calcum C. J.","year":"1977","journal-title":"Networks"},{"issue":"1","key":"e_1_2_1_152_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1977.1093710","article-title":"Network Design: An Algorithm for the access Facility Location Problem","volume":"25","author":"Mcgregor P. V.","year":"1977","journal-title":"I.E.E.E. Trans, on Communications"},{"issue":"5","key":"e_1_2_1_153_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The new routing algorithm for the ARPANET","volume":"25","author":"Mcquillan J.","year":"1980","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_154_1","doi-asserted-by":"crossref","unstructured":"Minieka E. \u201cMaximal lexicographic and dynamic network flows\u201d Operations Res. No. 221 1973.","DOI":"10.1287\/opre.21.2.517"},{"issue":"6","key":"e_1_2_1_155_1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/355616.364037","article-title":"On computing sets of shortest paths in a graph","volume":"17","author":"Minieka E.","year":"1974","journal-title":"Communications of the ACM"},{"volume-title":"Optimization algorithms for networks and graphs","year":"1978","author":"Minieka E.","key":"e_1_2_1_156_1"},{"key":"e_1_2_1_157_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110404"},{"key":"e_1_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190305"},{"key":"e_1_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094884"},{"key":"e_1_2_1_160_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150102"},{"key":"e_1_2_1_161_1","doi-asserted-by":"crossref","unstructured":"Moss F. H.Segall \u201cAn optimal control approach to dynamic routing in networks\u201d IEEE Trans. Automatic Control No. 27 pp.329\u2013339 1982.","DOI":"10.1109\/TAC.1982.1102915"},{"key":"e_1_2_1_162_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(84)90002-9"},{"key":"e_1_2_1_163_1","doi-asserted-by":"crossref","unstructured":"Neebe A. W.;Rao \u201cAn algorithm for the fixed\u2010charge assigning users to source problem\u201d Journal Opp. Research Soc No. 34 pp.1107\u20131113 1988.","DOI":"10.1057\/jors.1983.242"},{"issue":"11","key":"e_1_2_1_164_1","doi-asserted-by":"crossref","DOI":"10.1287\/mnsc.32.11.1467","article-title":"Sequencing Capacity Expansions projects in Continuous Time","volume":"32","author":"Neebe A. W","year":"1986","journal-title":"Management Science"},{"key":"e_1_2_1_165_1","unstructured":"Ogier R. G. \u201cDynamic routing in deterministic single\u2010commodity networks with fluid traffic\u201d. In Proceedings 1983 Conf. on Information Sciences and Systems John Hopkins Univ. Baltimore pp.565\u2013569 1983."},{"key":"e_1_2_1_166_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180405"},{"key":"e_1_2_1_167_1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/net.3230140308","article-title":"Optimal Dynamic Routing in Communication Networks with Continuous Traffic","volume":"14","author":"Ogier R. G.","year":"1984","journal-title":"Networks"},{"key":"e_1_2_1_168_1","unstructured":"PaglinoR. \u201cAlcuni problemi e metodi di soluzione relativi alla planificazione\u201d Thesis Universit\u00e1 di Milano 1987."},{"key":"e_1_2_1_169_1","unstructured":"PAIX\u00c3O J. eGouveia L. \u201cIdealiza\u00e7\u00e3o topol\u00f3gica de redes de comunica\u00e7\u00e3o de dados; parte 1: redes centralizadas\u201d Nota No. 30(86 Faculdade de Ci\u011bncias da Universidade de Lisboa (in Portuguese)."},{"key":"e_1_2_1_170_1","unstructured":"PAIX\u00c3O J. eGouveia L. M\u00e9todos de Investiga\u00e7|o Operacional na idealiza\u00e7|o topol\u00f3gica de redes centralizadas\u201d Comunica\u00e7|o no Congresso de Inform\u00e1tica Lisboa 1986 (in Portuguese)."},{"key":"e_1_2_1_171_1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitrion C. H.","year":"1978","journal-title":"NETWORKS"},{"volume-title":"Combinatorial optimization algorithms and complexity","year":"1982","author":"Papadimitriou C. H.","key":"e_1_2_1_172_1"},{"key":"e_1_2_1_173_1","doi-asserted-by":"crossref","unstructured":"Pirkul H. \u201cAn integer programming model for the allocation of databases in a distributed computer systems\u201d Eur. J. Operational Res. No. 26 3 1986.","DOI":"10.1016\/0377-2217(86)90142-6"},{"key":"e_1_2_1_174_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(87)90022-0"},{"key":"e_1_2_1_175_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.2769"},{"volume-title":"Computational Methods in Optimization","year":"1971","author":"Polak E.","key":"e_1_2_1_176_1"},{"key":"e_1_2_1_177_1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","article-title":"The Flow Deviation Method: An Approach to Store\u2010and\u2010Forward Communication Network Design","volume":"3","author":"Prata L.","year":"1973","journal-title":"Networks"},{"key":"e_1_2_1_178_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_179_1","article-title":"The development of long\u2010range planning model for the British telecommunications business: from initiation to implementation","volume":"32","author":"Probert D. E.","year":"1981","journal-title":"J. Opl. Res. Soc."},{"key":"e_1_2_1_180_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.516"},{"key":"e_1_2_1_181_1","first-page":"77","article-title":"Planning of junction network in a multi\u2010exchange area. I. General principles","volume":"20","author":"Rapp Y.","year":"1964","journal-title":"Ericsson Tech."},{"key":"e_1_2_1_182_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108011"},{"key":"e_1_2_1_183_1","unstructured":"Rosenberg E. \u201cAn integer programming approach to switch in a telecommunication network\u201d paper presented at the TIM\/ORSA Conference Chicago 1983."},{"key":"e_1_2_1_184_1","doi-asserted-by":"crossref","unstructured":"Rosenhead J. N. \u201cPlanning under uncertainty: a methodology for robustness analysis\u201d J. Operation Research Q. No 31 1971.","DOI":"10.2307\/2581626"},{"key":"e_1_2_1_185_1","article-title":"Robustness and optimality as criteria for strategic decisions","author":"Rosenhed J. V.","year":"1970","journal-title":"J. Opr. Research Q."},{"issue":"1","key":"e_1_2_1_186_1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCOM.1978.1093974","article-title":"On reliable topological structures for message\u2010switching communication networks","volume":"26","author":"Rubin I.","year":"1978","journal-title":"IEEE Trans, on Comm."},{"key":"e_1_2_1_187_1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230010307","article-title":"Network reliability analysis: part 1","volume":"1","author":"Van Slyke","year":"1971","journal-title":"NETWORKS"},{"key":"e_1_2_1_188_1","doi-asserted-by":"publisher","DOI":"10.2307\/2582827"},{"key":"e_1_2_1_189_1","unstructured":"SANTOS COELHOM. \u201cOptimiza\u00e7\u00e3o topol\u00f3gica de redes de dados centralizadas 2\u00b0 Workshop Nacional sobre tecnologias de comunicai\u00e7\u00e3o (in Portuguese)."},{"issue":"11","key":"e_1_2_1_190_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1987.1096709","article-title":"Optimal Dynamic Routing in Single Commodity Networks by Interactive Methods","author":"Sasaki G.","year":"1987","journal-title":"I.E.E.E. Trans, on Communications"},{"key":"e_1_2_1_191_1","first-page":"1","article-title":"An algorithm for the design of multilevel concentrator networks","volume":"6","author":"Schneider G. M.","year":"1982","journal-title":"Comp. networks"},{"volume-title":"Computer communication network design and analysis","year":"1977","author":"Schwartz M.","key":"e_1_2_1_192_1"},{"key":"e_1_2_1_193_1","doi-asserted-by":"crossref","unstructured":"SchwartzM.andCheungC. \u201cThe gradient projection algorithm for multiple routing in message\u2010switched networks\u201d IEEE Trans on comm. April1976.","DOI":"10.1109\/TCOM.1976.1093310"},{"key":"e_1_2_1_194_1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TCOM.1979.1094274","article-title":"Optimal Distributed Routing for virtual line\u2010switched data communication networks","volume":"27","author":"SEGALL","journal-title":"I.E.E.E. Trans on Communications"},{"issue":"1","key":"e_1_2_1_195_1","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1977.1093715","article-title":"The modeling of adaptative routing in data\u2010communications networks","volume":"25","author":"Segall A.","year":"1977","journal-title":"IEEE Trans, on comm."},{"key":"e_1_2_1_196_1","unstructured":"SharmaR. L. andAL\u2010BARDAIM. T. \u201cSuboptimal communication network synthesis\u201d Proc. Int. Comm. June1970 pp.19.11\u201319.16."},{"key":"e_1_2_1_197_1","unstructured":"ShatsS;SegallA. \u201cOpen Loop Solutions for the dynamic routing problems\u201d Report LIDS\u2010R\u2010922 lab. for Information and Decision Systems MIT 1980."},{"key":"e_1_2_1_198_1","doi-asserted-by":"crossref","unstructured":"ShoganA. \u201cConstructing a minimal\u2010cost spanning tree subject to resource constraints and flows requirements networks\u201d NETWORKS No. 13 1983 pp.169\u2013190.","DOI":"10.1002\/net.3230130203"},{"volume-title":"Telecommunication Networks: Design and Cost Characteristics","year":"1983","author":"Skoog R. A.","key":"e_1_2_1_199_1"},{"key":"e_1_2_1_200_1","doi-asserted-by":"crossref","unstructured":"Sridharan R. \u201cA Heuristic lagrangean algorithm for the capacitated plant location problem \u2010 a comment\u201d European J. of Oper. Research n\u00b0 23 264\u2013265 1986[s.o].","DOI":"10.1016\/0377-2217(86)90246-8"},{"key":"e_1_2_1_201_1","doi-asserted-by":"crossref","unstructured":"SteiglitzK. WeinerP.andKleitmanD. J. \u201cThe design of minimum\u2010cost survivable networks\u201d IEEE Trans circuit theory Nov.1969 pp.455\u2013460.","DOI":"10.1109\/TCT.1969.1083004"},{"key":"e_1_2_1_202_1","unstructured":"Stidhams S. \u201cOptimal control of admission routing and service in queues and networks of queues: a tutorial review\u201d Analytical and Computational Issues in Logistics R&D U.S. Army Research Office pp330\u2013377 1984."},{"key":"e_1_2_1_203_1","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TAC.1985.1104054","article-title":"Optimal control of admission to a queueing system","volume":"30","author":"Stidhams S.","year":"1985","journal-title":"IEEE Trans. Autom. Congr."},{"key":"e_1_2_1_204_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"volume-title":"Discrete optimization algorithms","year":"1983","author":"Syslo M.","key":"e_1_2_1_205_1"},{"volume-title":"Computer networks","year":"1981","author":"Tanenbaum A.","key":"e_1_2_1_206_1"},{"issue":"11","key":"e_1_2_1_207_1","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1109\/TCOM.1985.1096233","article-title":"Capacity allocation in multiple access networks","volume":"33","author":"Todd T. D.","year":"1985","journal-title":"IEEE Trans, on comm."},{"issue":"7","key":"e_1_2_1_208_1","article-title":"A K\u2010shortest Path Algorithm for Adaptative Routing in Communications Networks","volume":"36","author":"Topkis Donald","year":"1988","journal-title":"IEEE Trans, on common."},{"key":"e_1_2_1_209_1","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1287\/mnsc.21.9.986","article-title":"The warehouse location formulation as a special type of inspection problem","volume":"12","author":"Trippi R.","year":"1975","journal-title":"Manag. Sci."},{"issue":"3","key":"e_1_2_1_210_1","article-title":"Optimal and suboptimal control for Markov chains","author":"Varaya","year":"1978","journal-title":"I.E.E.E. Trans. Aut. Control"},{"key":"e_1_2_1_211_1","doi-asserted-by":"crossref","unstructured":"Villis R;Georganas N. \u201cClustering algorithm for the topological design of hierarchical multidrop data networks\u201d Comp. Common. No. 2 pp.105\u2013110 1979.","DOI":"10.1016\/0140-3664(79)90180-4"},{"key":"e_1_2_1_212_1","unstructured":"Walstrom B. \u201cMethods for Optimizing alternate routing networks\u201d Ericsson Techn. No 1 1969."},{"key":"e_1_2_1_213_1","unstructured":"WhitneyV. \u201cComparison of network topology optimization algorithms\u201d Proc. Int. Conf. Comm. 1970."},{"key":"e_1_2_1_214_1","unstructured":"WooL. S. andTangD. T. \u201cOptimization of teleprocessing networks with concentrators\u201d Proc. Nat. Telecomm. Conf. Atlanta1973."},{"key":"e_1_2_1_215_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(88)90033-0"},{"key":"e_1_2_1_216_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1975.5409151"},{"key":"e_1_2_1_217_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040104"},{"key":"e_1_2_1_218_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030404"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460030511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460030511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:33:41Z","timestamp":1738362821000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460030511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":217,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["10.1002\/ett.4460030511"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460030511","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"type":"print","value":"1124-318X"},{"type":"electronic","value":"1541-8251"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}