{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:44Z","timestamp":1755221024002,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1023\/a:1019157904460","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"321-329","source":"Crossref","is-referenced-by-count":0,"title":["Designing packet\u2010switched feeder networks with survivability and node compatibility constraints: Korean HiNET\u2010P case"],"prefix":"10.1007","volume":"14","author":[{"given":"Young Ki","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok Ha","family":"Koh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"June S.","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329813_CR1","doi-asserted-by":"crossref","unstructured":"Y.K. Agarwal, An algorithm for designing survivable networks, AT&T Technical Journal (1989) 64\u201376.","DOI":"10.1002\/j.1538-7305.1989.tb00320.x"},{"key":"329813_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"D. Bienstock and O. Gunluk, Capacitated network design \u2013 polyhedral structure and computation, INFORMS Journal on Computing 8 (1996) 243\u2013259.","journal-title":"INFORMS Journal on Computing"},{"key":"329813_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R. Boorstyn","year":"1977","unstructured":"R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Transactions on Communications 25 (1977) 29\u201346.","journal-title":"IEEE Transactions on Communications"},{"key":"329813_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G. Dahl","year":"1998","unstructured":"G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10 (1998) 1\u201311.","journal-title":"INFORMS Journal on Computing"},{"key":"329813_CR5","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 method: Approach to store-and forward computer communication network design, Networks 3 (1973) 97\u2013133.","journal-title":"Networks"},{"key":"329813_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0377-2217(92)90204-M","volume":"58","author":"B. Gavish","year":"1992","unstructured":"B. Gavish, Topological design of computer communication networks \u2013 the overall design problem, European Journal of Operational Research 58 (1992) 149\u2013172.","journal-title":"European Journal of Operational Research"},{"key":"329813_CR7","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/49.35563","volume":"7","author":"B. Gavish","year":"1989","unstructured":"B. Gavish, P. Trudeau, M. Dror, M. Gendreau and L. Mason, Fiberoptic circuit network design under reliability constraints, IEEE Journal on Selected Areas in Communications 7 (1989) 1181\u20131187.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"329813_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"25","author":"M. Gerla","year":"1977","unstructured":"M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Transactions on Communications 25 (1977) 48\u201360.","journal-title":"IEEE Transactions on Communications"},{"key":"329813_CR9","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/49.62854","volume":"8","author":"A. Gersht","year":"1990","unstructured":"A. Gersht and R. Weihmayer, Joint optimization of data network design and facility selection, IEEE Journal on Selected Areas in Communications 8 (1990) 1667\u20131681.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"329813_CR10","volume-title":"Capacitated network design with column generation","author":"P. Gong","year":"1995","unstructured":"P. Gong, Capacitated network design with column generation, Ph.D. thesis, Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (1995)."},{"key":"329813_CR11","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"J.W. Herrmann, A dual ascent approach to the fixed-charge capacitated network design problem, European Journal of Operational Research 95 (1996) 476\u2013490.","journal-title":"European Journal of Operational Research"},{"key":"329813_CR12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1287\/ijoc.10.1.25","volume":"10","author":"F. Kaefer","year":"1998","unstructured":"F. Kaefer and J.S. Park, Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms, INFORMS Journal on Computing 10 (1998) 25\u201339.","journal-title":"INFORMS Journal on Computing"},{"key":"329813_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/26.81738","volume":"39","author":"A. Kershenbaum","year":"1991","unstructured":"A. Kershenbaum, P. Kermani and G. Grover, MENTOR: An algorithm for mesh network topological optimization and routing, IEEE Transactions on Communications 39 (1991) 503\u2013513.","journal-title":"IEEE Transactions on Communications"},{"key":"329813_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02114284","volume":"6","author":"L. LeBlanc","year":"1996","unstructured":"L. LeBlanc, J.S. Park, V. Sridhar and J. Kalvenes, Topology design and bridge-capacity assignment for interconnecting token ring LANs: Simulated annealing approach, Telecommunication Systems 6 (1996) 21\u201343.","journal-title":"Telecommunication Systems"},{"key":"329813_CR15","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research 43 (1995) 142\u2013157.","journal-title":"Operations Research"},{"key":"329813_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","volume":"37","author":"C.L. Monma","year":"1989","unstructured":"C.L. Monma and D.F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints, Operations Research 37 (1989) 531\u2013541.","journal-title":"Operations Research"},{"key":"329813_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/24.93764","volume":"4","author":"K.T. Newport","year":"1991","unstructured":"K.T. Newport and P.K. Varshney, Design of survivable communications networks under performance constraints, IEEE Transactions on Reliability 4 (1991) 433\u2013440.","journal-title":"IEEE Transactions on Reliability"},{"key":"329813_CR18","unstructured":"V. Sridhar and J.S. Park, Benders-and-cut algorithm for fixed-charge capacitated network design problems, European Journal of Operational Research (forthcoming)."},{"key":"329813_CR19","unstructured":"V. Sridhar, J.S. Park and B. Gavish, LP-based heuristic algorithms for interconnecting token rings via source routing bridges, Journal of Heuristics (forthcoming)."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019157904460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019157904460\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019157904460.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:29:51Z","timestamp":1754634591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019157904460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":19,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["329813"],"URL":"https:\/\/doi.org\/10.1023\/a:1019157904460","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}