{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:10:04Z","timestamp":1751368204204,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1016231031814","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T02:48:35Z","timestamp":1041130115000},"page":"79-88","source":"Crossref","is-referenced-by-count":2,"title":["A Concavity Result for Network Design Problems"],"prefix":"10.1007","volume":"24","author":[{"given":"S.","family":"Ketabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.J.M.","family":"Salzborn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"405535_CR1","unstructured":"Ahuja, R. K., Magnanti, T. L. and Orlin, J. O. (1993), Network Flows, Prentice Hall, Englewood Cliffs."},{"key":"405535_CR2","unstructured":"Ashtiani, H. Z. (1989), On The Objective Function for Network Design Problems, Technical Report, Isfahan University of Technology, Unpublished."},{"key":"405535_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A. A. Assad","year":"1978","unstructured":"Assad, A. A. (1978), Multicommodity Network Flows \u00b6A Survey, Networks, 8, 37\u201391.","journal-title":"Networks"},{"key":"405535_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization","author":"J. F. Bard","year":"1998","unstructured":"Bard, J. F. (1998), Practical Bilevel Optimization, Kluwer Academic Publishers, Dordrecht."},{"key":"405535_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230190202","volume":"19","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A. and Graves, S. C. (1989), A Composite Algorithm for a Concave-Cost Network Flow Problem, Networks, 19, 175\u2013202.","journal-title":"Networks"},{"key":"405535_CR6","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D. and Gallager, R. (1992), Data Networks, Prentice Hall, Englewood Cliffs, NJ."},{"key":"405535_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<1::AID-NAV1>3.0.CO;2-1","volume":"47","author":"K. M. Bretthauer","year":"2000","unstructured":"Bretthauer, K. M. (2000), Optimal Service And Arrival Rates in Jackson Queueing Networks, Naval Res. Logis., 47, 1\u201317.","journal-title":"Naval Res. Logis."},{"key":"405535_CR8","doi-asserted-by":"crossref","unstructured":"Dantzig, G. D., Harvey, R., Lansdowne, Z., Robinson, D. and Maier, S. Formulation and Solving the Network Design Problem by Decomposition, Transportation Research B, 13 5\u201317.","DOI":"10.1016\/0191-2615(79)90003-1"},{"key":"405535_CR9","first-page":"176","volume":"26","author":"M. Florian","year":"1986","unstructured":"Florian, M. (1986), Nonlinear Cost Network Models in Transportation Analysis, Mathematical Programming Study, 26, 176\u2013196.","journal-title":"Mathematical Programming Study"},{"key":"405535_CR10","doi-asserted-by":"crossref","unstructured":"Gendron, B. and Crainic, T. and Frangioni, A. (1998), Multicommodity Capacitated Network Design, in B. Sans'o and P. Soriano (eds), Telecommunications Network Planning, pp. 1\u201319, Kluwer, Norwell.","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"405535_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","volume":"25","author":"M. Gerla","year":"1977","unstructured":"Gerla, M. and Kleinrock, L. (1977), On the Topological Design of Distributed Computer Networks, IEEE Transaction on Communications 25, 48\u201360.","journal-title":"IEEE Transaction on Communications"},{"key":"405535_CR12","doi-asserted-by":"crossref","unstructured":"Guisewite, G. M. (1995), Network Problems, in R. Horst and P. M. Pardalos (eds), Handbook of Global Optimization, pp. 609\u2013648. Kluwer, Dordrecht.","DOI":"10.1007\/978-1-4615-2025-2_11"},{"key":"405535_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G.M. Guisewite","year":"1990","unstructured":"Guisewite, G.M. and Pardalos, P.M. (1990), Minimum Concave\u00b6 cost Network Flow Problems: Applications, Complexity, and Algorithms, Annals of Operations Research 25, 75\u2013100.","journal-title":"Annals of Operations Research"},{"key":"405535_CR14","doi-asserted-by":"crossref","unstructured":"Homqvist, K. and Migdalas, A. and Pardalos, P. M. (1998), A Grasp Algorithm for the Single Source Uncapacitated Minimum Concave-Cost Network Flow Problems, in P.M. Pardalos and D. Z. Du (eds.), Network Design: Connectivity and Facilities Location, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 40, 131\u2013142.","DOI":"10.1090\/dimacs\/040\/09"},{"key":"405535_CR15","first-page":"243","volume":"11","author":"C. J. Humes","year":"1992","unstructured":"Humes, C. J. (1992), A Projection-Feasible Direction Method for Continuous Capacity and Flow Assignment, Mat. Apl. Comput., 11, 243\u2013254.","journal-title":"Mat. Apl. Comput."},{"key":"405535_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J. L. Kennington","year":"1978","unstructured":"Kennington, J. L. (1978), A Survey of Linear Cost Multicommodity Network Flows, Operations Research 26, 209\u2013236.","journal-title":"Operations Research"},{"key":"405535_CR17","first-page":"1","volume":"18","author":"T. L. Magnanti","year":"1984","unstructured":"T. L. Magnanti and R. T. Wong, Network design and transportaion planning: models and algorithms, Transportation Science, 18:1\u201355, 1984.","journal-title":"Network design and transportaion planning: models and algorithms, Transportation Science"},{"key":"405535_CR18","unstructured":"Manheim, M. L. (1979), Fundamentals of Transportaion System Analysis, MIT Press, Cambridge, MA."},{"key":"405535_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02997589","volume":"31","author":"M. Minoux","year":"1976","unstructured":"Minoux, M. (1976), Multiflots de cout concaves, Annales Des Telecommunications, 31, 77\u201392.","journal-title":"Annales Des Telecommunications"},{"key":"405535_CR20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M. (1989), Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Application, Networks, 19, 313\u2013360.","journal-title":"Networks"},{"issue":"10","key":"405535_CR21","first-page":"1566","volume":"82\u00b6 B","author":"S. Runggeratigul","year":"1999","unstructured":"Runggeratigul, S. and Tantaratana, S. (1999), Link Capacity Assignment in Packet-switched Networks: The Case of Piecewise Linear Concave Cost Function, IEICE Transactions on Communications, E82\u00b6 B(10), 1566\u20131576.","journal-title":"IEICE Transactions on Communications"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016231031814.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016231031814\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016231031814.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:45:19Z","timestamp":1751366719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016231031814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["405535"],"URL":"https:\/\/doi.org\/10.1023\/a:1016231031814","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}