{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:36:34Z","timestamp":1743143794867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319023083"},{"type":"electronic","value":"9783319023090"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-02309-0_61","type":"book-chapter","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T07:57:47Z","timestamp":1379577467000},"page":"559-566","source":"Crossref","is-referenced-by-count":1,"title":["Designing Frame Relay WAN Networks with Trade-Off between Link Cost and Performance"],"prefix":"10.1007","author":[{"given":"Mariusz","family":"Gola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Czubak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"18","key":"61_CR1","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1016\/S0140-3664(98)00175-3","volume":"21","author":"A. Amiri","year":"1998","unstructured":"Amiri, A.: A system for the design of packet-switched communication networks with economic tradeoffs. Computer Communications\u00a021(18), 1670\u20131680 (1998)","journal-title":"Computer Communications"},{"key":"61_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press (2001)"},{"issue":"2","key":"61_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"Fratta, L., Gerla, M., Kleinrock, L.: The flow deviation method: An approach to store-and-forward communication network design. Networks\u00a03(2), 97\u2013133 (1973)","journal-title":"Networks"},{"issue":"4","key":"61_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/26.20116","volume":"37","author":"B. Gavish","year":"1989","unstructured":"Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications\u00a037(4), 360\u2013366 (1989)","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"61_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.12785\/isl\/020103","volume":"2","author":"M.R. Girgis","year":"2013","unstructured":"Girgis, M.R., Mahmoud, T.M., El-Hameed, H.F.A., El-Saghier, Z.M.: Routing and capacity assignment problem in computer networks using genetic algorithm. Information Sciences Letters\u00a02(1), 13\u201325 (2013)","journal-title":"Information Sciences Letters"},{"key":"61_CR6","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.endm.2010.05.132","volume":"36","author":"J. Gladysz","year":"2010","unstructured":"Gladysz, J., Walkowiak, K.: Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions - exact and heuristic algorithms. Electronic Notes in Discrete Mathematics\u00a036, 1041\u20131048 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"61_CR7","unstructured":"Gola, M.: An algorithms for capacity and flow assignment in wide area computer network with combined cost criterion. Ph.D. thesis, Wroclaw University of Technology (2000)"},{"key":"61_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-24767-8_64","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"M. Gola","year":"2004","unstructured":"Gola, M., Kasprzak, A.: Exact and approximate algorithms for two-criteria topological design problem of WAN with budget and delay constraints. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 611\u2013620. Springer, Heidelberg (2004)"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Pi\u00f3ro, M., Medhi, D.: Routing, flow, and capacity design in communication and computer networks, 1st edn. Morgan Kaufmann (2004)","DOI":"10.1016\/B978-012557189-0\/50002-0"},{"issue":"11","key":"61_CR10","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1016\/j.cor.2004.04.004","volume":"32","author":"J. Shen","year":"2005","unstructured":"Shen, J., Xu, F., Zheng, P.: A tabu search algorithm for the routing and capacity assignment problem in computer networks. Computers & Operations Research\u00a032(11), 2785\u20132800 (2005)","journal-title":"Computers & Operations Research"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-540-69848-7_63","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"K. Walkowiak","year":"2008","unstructured":"Walkowiak, K.: A flow deviation algorithm for joint optimization of unicast and anycast flows in connection-oriented networks. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part II. LNCS, vol.\u00a05073, pp. 797\u2013807. Springer, Heidelberg (2008)"},{"issue":"9","key":"61_CR12","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.aeue.2008.06.006","volume":"63","author":"E.C.G. Wille","year":"2009","unstructured":"Wille, E.C.G., Mellia, M., Leonardi, E., Marsan, M.A.: A lagrangean relaxation approach for qos networks cfa problems. AEU - International Journal of Electronics and Communications\u00a063(9), 743\u2013753 (2009)","journal-title":"AEU - International Journal of Electronics and Communications"}],"container-title":["Advances in Intelligent Systems and Computing","Man-Machine Interactions 3"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02309-0_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T01:43:09Z","timestamp":1676338989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-02309-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319023083","9783319023090"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02309-0_61","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}