{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:19:20Z","timestamp":1649035160206},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s11235-008-9068-2","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T17:59:55Z","timestamp":1203011995000},"page":"181-203","source":"Crossref","is-referenced-by-count":3,"title":["Minimum concave cost multicommodity network design"],"prefix":"10.1007","volume":"36","author":[{"given":"C\u00fcneyt F.","family":"Bazlama\u00e7c\u0131","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatih","family":"Say","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,15]]},"reference":[{"key":"9068_CR1","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1057\/palgrave.jors.2600363","volume":"48\/3","author":"A. Amiri","year":"1997","unstructured":"Amiri, A., & Pirkul, H. (1997). New formulation and relaxation to solve a concave-cost network flow problem. Journal of Operational Research Society, 48\/3, 278\u2013287.","journal-title":"Journal of Operational Research Society"},{"issue":"1\u20134","key":"9068_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1013867331662","volume":"22","author":"L. T. H. An","year":"2002","unstructured":"An, L. T. H., & Tao, P. D. (2002). D. C. programming approach for multicommodity network optimization problems with step increasing cost functions. Journal of Global Optimization, 22(1\u20134), 205\u2013232.","journal-title":"Journal of Global Optimization"},{"key":"9068_CR3","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1989). A dual-ascent procedure for large scale uncapacitated network design. Operational Research, 37, 716\u2013740.","journal-title":"Operational Research"},{"key":"9068_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230190202","volume":"19","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., & Graves, C. S. (1989). A composite algorithm for a concave-cost network flow problem. Networks, 19, 175\u2013202.","journal-title":"Networks"},{"key":"9068_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"Balakrishnan, A., Magnanti, T. L., Shulman, A., & Wong, R. T. (1991). Models for planning capacity expension in local access telecommunication networks. Annals of Operations Research, 33, 239\u2013284.","journal-title":"Annals of Operations Research"},{"key":"9068_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","volume":"43","author":"A. Balakrishnan","year":"1995","unstructured":"Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1995). A decomposition algorithm for local access telecommunications network expanding planning. Operational Research, 43, 58\u201376.","journal-title":"Operational Research"},{"key":"9068_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/1520-6750(198808)35:4<503::AID-NAV3220350406>3.0.CO;2-N","volume":"35","author":"I. Baybars","year":"1988","unstructured":"Baybars, I., & Edahl, R. H. (1988). A heuristic method for facility planning in telecommunications networks with multiple alternate routes. Naval Research Logistics, 35, 503\u2013528.","journal-title":"Naval Research Logistics"},{"key":"9068_CR8","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1057\/jors.1996.143","volume":"47","author":"C. F. Bazlama\u00e7c\u0131","year":"1996","unstructured":"Bazlama\u00e7c\u0131, C. F., & Hindi, K. S. (1996). Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem. Journal of Operational Research Society, 47, 1150\u20131165.","journal-title":"Journal of Operational Research Society"},{"key":"9068_CR9","unstructured":"Bazlama\u00e7c\u0131, C. F. (1996). Optimised network design: minimum spanning trees and minimum concave-cost problems. Ph.D. Thesis, University of Manchester Institute of Science and Technology (UMIST), Manchester."},{"key":"9068_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02136170","volume":"1","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D. (1993). Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommunication Systems, 1, 379\u2013400.","journal-title":"Telecommunication Systems"},{"key":"9068_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02136157","volume":"1","author":"S. G. Chang","year":"1993","unstructured":"Chang, S. G., & Gavish, B. (1993). Telecommunications network topological design and capacity expansion: formulations and algorithms. Telecommunication Systems, 1, 99\u2013131.","journal-title":"Telecommunication Systems"},{"key":"9068_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/opre.43.1.43","volume":"43","author":"S. G. Chang","year":"1995","unstructured":"Chang, S. G., & Gavish, B. (1995). Lower bounding procedures for multiperiod telecommunications network expansion problems. Operations Research, 43, 43\u201357.","journal-title":"Operations Research"},{"issue":"5","key":"9068_CR13","first-page":"1122","volume":"19","author":"G. N. Chattopadhyay","year":"1989","unstructured":"Chattopadhyay, G. N., Morgan, T. W., & Raghuram, A. (1989). An innovative technique for backbone network design. IEEE Transactions on Systems, 19(5), 1122\u20131132.","journal-title":"IEEE Transactions on Systems"},{"key":"9068_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/24.740489","volume":"47\/3","author":"S. T. Cheng","year":"1998","unstructured":"Cheng, S. T. (1998). Topological optimization of a reliable communication network. IEEE Transactions on Reliability, 47\/3, 225\u2013233.","journal-title":"IEEE Transactions on Reliability"},{"key":"9068_CR15","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.40.4.689","volume":"40","author":"A. Dutta","year":"1992","unstructured":"Dutta, A., & Lim, J. I. (1992). A multiperiod capacity planning model for backbone computer communication networks. Operations Research, 40, 689\u2013705.","journal-title":"Operations Research"},{"key":"9068_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0377-2217(79)90144-9","volume":"3","author":"G. Gallo","year":"1979","unstructured":"Gallo, G., & Sodini, C. (1979). Concave cost minimization on networks. European Journal of Operations Research, 3, 239\u2013249.","journal-title":"European Journal of Operations Research"},{"key":"9068_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230090202","volume":"9","author":"G. Gallo","year":"1979","unstructured":"Gallo, G., & Sodini, C. (1979). Adjacent extreme flows and application to minimum concave cost flow problems. Networks, 9, 95\u2013121.","journal-title":"Networks"},{"key":"9068_CR18","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/26.20116","volume":"5 COM-37","author":"B. Gavish","year":"1989","unstructured":"Gavish, B., & Neuman, I. (1989). A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications, 5 COM-37, 360\u2013366.","journal-title":"IEEE Transactions on Communications"},{"key":"9068_CR19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","volume":"2","author":"B. Gavish","year":"1990","unstructured":"Gavish, B., & Altinkemer, K. (1990). Backbone network design tools with economic tradeoffs. ORSA Journal on Computing, 2, 236\u2013245.","journal-title":"ORSA Journal on Computing"},{"key":"9068_CR20","first-page":"48","volume":"COM-25","author":"M. Gerla","year":"1987","unstructured":"Gerla, M., & Kleinrock, L. (1987). On the topological design of distributed computer networks. IEEE Transactions on Communications, COM-25, 48\u201360.","journal-title":"IEEE Transactions on Communications"},{"issue":"9","key":"9068_CR21","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1109\/49.62854","volume":"8","author":"A. Gersht","year":"1990","unstructured":"Gersht, A., & Weihmayer, R. (1990). Joint optimization of data network design and facility selection. IEEE Journal on Selected Areas in Communications, 8(9), 1667\u20131681.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1\u20132","key":"9068_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00453-005-1155-0","volume":"43","author":"A. Goel","year":"2005","unstructured":"Goel, A., & Estrin, D. (2005). Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. Algorithmica, 43(1\u20132), 5\u201315.","journal-title":"Algorithmica"},{"key":"9068_CR23","volume-title":"Graphs and algorithms","author":"M. Gondran","year":"1984","unstructured":"Gondran, M., & Minoux, M. (1984). Graphs and algorithms. New York: Wiley."},{"key":"9068_CR24","series-title":"Computer Applications","volume-title":"Queuing Systems","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L. (1976). Queuing Systems, vol. 2. Computer Applications. New York: Wiley."},{"key":"9068_CR25","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.30.5.907","volume":"30","author":"H. Luss","year":"1982","unstructured":"Luss, H. (1982). Operations research and the capacity expansion programs: a survey. Operations Research, 30, 907\u2013974.","journal-title":"Operations Research"},{"issue":"1","key":"9068_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. L. Magnanti","year":"1984","unstructured":"Magnanti, T. L., & Wong, R. T. (1984). Network design and transportation planning: models and algorithms. Transportation Science, 18(1), 1\u201355.","journal-title":"Transportation Science"},{"key":"9068_CR27","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T. L. Magnanti","year":"1995","unstructured":"Magnanti, T. L., Mirchandani, P., & Vachani, R. (1995). Modeling and solving the two-facility capacitated network loading problem. Operations Research, 43, 142\u2013157.","journal-title":"Operations Research"},{"key":"9068_CR28","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02997589","volume":"31","author":"M. Minoux","year":"1976","unstructured":"Minoux, M. (1976). Multinots de cout minimal avec functions de cout concaves. Annales des Telecommunications, 31, 77\u201392.","journal-title":"Annales des Telecommunications"},{"key":"9068_CR29","first-page":"283","volume":"31","author":"M. Minoux","year":"1987","unstructured":"Minoux, M. (1987). Network synthesis and dynamic optimization. Annals of Discrete Mathematics, 31, 283\u2013324.","journal-title":"Annals of Discrete Mathematics"},{"key":"9068_CR30","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"9","author":"M. Minoux","year":"1989","unstructured":"Minoux, M. (1989). Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, 9, 313\u2013360.","journal-title":"Networks"},{"issue":"7","key":"9068_CR31","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/07408170490447357","volume":"36","author":"A. Muriel","year":"2004","unstructured":"Muriel, A., & Munsh, F. (2004). Capacitated multicommodity network flow problems with piecewise linear concave costs. IIE Transactions, 36(7), 683\u2013696.","journal-title":"IIE Transactions"},{"key":"9068_CR32","first-page":"202","volume":"COM-35","author":"S. H. Parrish","year":"1987","unstructured":"Parrish, S. H., Cox, T., Kuehner, W., & Qui, Y. (1987). Planning for optimal expansion of leased line communications network. IEEE Transactions on Communications, COM-35, 202\u2013209.","journal-title":"IEEE Transactions on Communications"},{"key":"9068_CR33","unstructured":"Say, F. (2005). Minimum concave cost multicommodity network design. M.Sc. Thesis, Middle East Technical University, Ankara."},{"key":"9068_CR34","volume-title":"Network topology optimization: The art and science of network design","author":"R. L. Sharma","year":"1990","unstructured":"Sharma, R. L. (1990). Network topology optimization: The art and science of network design. New York: Reinhol."},{"key":"9068_CR35","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1019156409486","volume":"13","author":"C. H. E. Stacey","year":"2000","unstructured":"Stacey, C. H. E., Eyers, T., & Anido, G. J. (2000). A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems. Telecommunication Systems, 13, 351\u2013372.","journal-title":"Telecommunication Systems"},{"issue":"1","key":"9068_CR36","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/moor.24.1.106","volume":"24","author":"J. Ward","year":"1999","unstructured":"Ward, J. (1999). Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks. Mathematics of Operations Research, 24(1), 106\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"9068_CR37","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230010205","volume":"1","author":"B. A. Yaged Jr.","year":"1971","unstructured":"Yaged, B. A. Jr. (1971). Minimum cost routing for static network models. Networks, 1, 139\u2013172.","journal-title":"Networks"},{"key":"9068_CR38","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230030302","volume":"3","author":"B. A. Yaged Jr.","year":"1973","unstructured":"Yaged, B. A. Jr. (1973). Minimum cost routing for dynamic network models. Networks, 3, 193\u2013224.","journal-title":"Networks"},{"key":"9068_CR39","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230030404","volume":"3","author":"N. Zadeh","year":"1973","unstructured":"Zadeh, N. (1973). On building minimum cost communication networks. Networks, 3, 315\u2013331.","journal-title":"Networks"},{"key":"9068_CR40","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W. I. Zangwill","year":"1968","unstructured":"Zangwill, W. I. (1968). Minimum concave cost flows in certain networks. Management Science, 14, 429\u2013450.","journal-title":"Management Science"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-008-9068-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-008-9068-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-008-9068-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T08:02:50Z","timestamp":1630742570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-008-9068-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9068"],"URL":"https:\/\/doi.org\/10.1007\/s11235-008-9068-2","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}