{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:34:37Z","timestamp":1773678877033,"version":"3.50.1"},"reference-count":21,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8533,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An effective method of solving a practical class of multicommodity transportation problems is presented. The heuristic procedure combines theoretical results concerning multicommodity network structures and recent results on aggregation theory. Computational implementation has shown that problems with thousands of variables can be solved to within a few percent of optimality in a matter of seconds. Only widely available network codes are required to implement the procedure, thus making it attractive for smaller computers.<\/jats:p>","DOI":"10.1002\/net.3230130205","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T14:57:08Z","timestamp":1178895428000},"page":"197-205","source":"Crossref","is-referenced-by-count":12,"title":["A network decomposition\/aggregation procedure for a class of multicommodity transportation problems"],"prefix":"10.1002","volume":"13","author":[{"given":"James R.","family":"Evans","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"A.Ali R.Helgason J.Kennington andH.Lall Solving multicommodity network flow problems. Southern Methodist University Technical Report IEOR 77015 (1977)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.1.82"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.1.1"},{"key":"e_1_2_1_5_2","volume-title":"GNET: A primal capacitated network program","author":"Bradley G. H.","year":"1975"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580684"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.4.673"},{"key":"e_1_2_1_8_2","unstructured":"J. R.Evans Solving multicommodity transportation problems through aggregation. Presented at the1978ORSA\/TIMS Conference Los Angeles."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(79)90003-0"},{"key":"e_1_2_1_10_2","unstructured":"J. R.Evans Model simplification in multicommodity distribution systems through aggregation Proceedings 1979 Annual Meeting of the American Institute of Decision Sciences 1979."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584345"},{"key":"e_1_2_1_12_2","volume-title":"Transportation and Logistics","author":"Fair M. L.","year":"1981"},{"key":"e_1_2_1_13_2","unstructured":"A.Geoffrion Customer aggregation in distribution modeling. UCLA Management Science Study Center Working Paper #259 (1976)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.822"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040302"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584987"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010404"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800240210"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.9.994"},{"key":"e_1_2_1_20_2","volume-title":"Optimization Algorithms for Networks and Graphs","author":"Minieka E.","year":"1978"},{"key":"e_1_2_1_21_2","unstructured":"C.Swoveland Decomposition algorithms for the multi\u2010commodity distribution problem. UCLA Western Management Science Institute Working Paper 184 (1971)."},{"key":"e_1_2_1_22_2","unstructured":"P. H.Zipkin Aggregation in linear programming. Ph.D. Thesis Yale University (1977)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:16:36Z","timestamp":1697793396000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/net.3230130205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}