{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T21:17:21Z","timestamp":1779311841085,"version":"3.51.4"},"reference-count":23,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11333,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1975,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper develops an algorithm for handling nonlinear minimum\u2010cost multicommodity flow problems and applies it to a specific large\u2010scale network. The commodities will be imports and exports; the cost functions will be quadratic and convex. The setting will be a Port Planning Model which will seek to find optimal simultaneous routings through the network while fulfilling requirements both at foreign ports and at domestic hinterlands. The computer program written solves such a problem. The algorithm involves linearizing the cost function and solving the resulting linear program, which is, in fact, a series of shortest route problems. Negative cycles are studied in depth.<\/jats:p>","DOI":"10.1002\/net.3230050404","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T02:31:41Z","timestamp":1178850701000},"page":"331-356","source":"Crossref","is-referenced-by-count":20,"title":["A minimum\u2010cost multicommodity network flow problem concerning imports and exports"],"prefix":"10.1002","volume":"5","author":[{"given":"B. L.","family":"Golden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Bozoki G. \u201cMinimum Cost Multi\u2010Commodity Network Flows \u201d Ph.D. Thesis Purdue University 1969."},{"key":"e_1_2_1_3_2","volume-title":"Finite Graphs and Networks","author":"Busacker R.","year":"1965"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","volume-title":"A Tight Upper Bound on the Rate of Convergence of the Frank\u2010Wolfe Algorithm","author":"Cannon M.","DOI":"10.1137\/0306032"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.5.4.366"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.1.73"},{"key":"e_1_2_1_7_2","volume-title":"Linear Programming and Extensions","author":"Dantzig G.","year":"1962"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_10_2","volume-title":"Communication, Transmission, and Transportation Networks","author":"Frank H.","year":"1971"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_2_1_12_2","unstructured":"Frankel E. B.Golden P.Wilmes R.Orner K.Chelst andM.Creton \u201cPort Design and Analysis Methodology \u201d M.I.T. Commodity Transportation Laboratory Report 1974."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030202"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"Golden B. \u201cA Minimum\u2010Cost Multicommodity Network Flow Problem Concerning Imports and Exports \u201d Operations Research Center Master's Thesis M.I.T. 1974.","DOI":"10.1002\/net.3230050404"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"Griffith R.andR.Stewart \u201cA Nonlinear Programming Technique for the Optimization of Continuous Processing Systems \u201d Management Science 1961 pp.379\u2013392.","DOI":"10.1287\/mnsc.7.4.379"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"Grigoriadis M.andW.White \u201cA Partioning Algorithm for the Multicommodity Network Flow Problem \u201dMathematical Programming 1972 pp.157\u2013177.","DOI":"10.1007\/BF01584987"},{"key":"e_1_2_1_17_2","volume-title":"Optimization Theory for Large Systems","author":"Lasdon L.","year":"1970"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.2.168"},{"key":"e_1_2_1_19_2","volume-title":"Introduction to Linear and Nonlinear Programming","author":"Luenberger D.","year":"1973"},{"key":"e_1_2_1_20_2","volume-title":"Nonlinear Programming","author":"Mangasarian O.","year":"1969"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.1.45"},{"key":"e_1_2_1_22_2","doi-asserted-by":"crossref","unstructured":"Witzgall C.andJ.Gilsinn \u201cA Performance Comparison of Labelling Algorithms for Calculating Shortest Path Trees \u201d National Bureau of Standards Technical Note 772 May1973.","DOI":"10.6028\/NBS.TN.772"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010304"},{"key":"e_1_2_1_24_2","volume-title":"Nonlinear Programming: A Unified Approach","author":"Zangwill W.","year":"1969"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230050404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230050404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:22:04Z","timestamp":1699791724000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230050404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,10]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1975,10]]}},"alternative-id":["10.1002\/net.3230050404"],"URL":"https:\/\/doi.org\/10.1002\/net.3230050404","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,10]]}}}