{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:23Z","timestamp":1698127823044},"reference-count":28,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5276,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Each iteration of the primal\u2014dual linear programming algorithm entails a dual update. For the maximal multicommodity flow problem, and for multicommodity network synthesis, that requires finding a breakpoint in a parametric all pairs' shortest path problem. A procedure based on the Floyd\u2014Warshall Algorithm solves this problem in polynomial (cubic in the number of nodes) time.<\/jats:p>","DOI":"10.1002\/net.3230220306","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:22:07Z","timestamp":1178972527000},"page":"283-295","source":"Crossref","is-referenced-by-count":5,"title":["On a parametric shortest path problem from primal\u2014dual multicommodity network optimization"],"prefix":"10.1002","volume":"22","author":[{"given":"George G.","family":"Polak","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","volume-title":"Handbooks in Operations Research and Management Science, Volume 1: Optimization","author":"Ahuja R. K.","year":"1989"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080107"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.97"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0109002"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0110020"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0112029"},{"key":"e_1_2_1_10_2","unstructured":"D. M.Gusfield Sensitivity analysis for combinatiorial optimization. PhD Dissertation University of California Berkeley (1980)."},{"key":"e_1_2_1_11_2","volume-title":"Integer Programming and Network Flows","author":"Hu T. C.","year":"1969"},{"key":"e_1_2_1_12_2","volume-title":"Combinatorial Optimization and Integer Programming","author":"Hu T. C.","year":"1982"},{"issue":"4","key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.15807\/jorsj.28.269","article-title":"A shortest path approach to a multifacility minimax location problem with rectilinear distances","volume":"28","author":"Ichimori T.","year":"1985","journal-title":"J. Operations Res. Soc. Jpn."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90026-3"},{"key":"e_1_2_1_15_2","volume-title":"Algorithms for Network Programming","author":"Kennington J. L.","year":"1980"},{"key":"e_1_2_1_16_2","unstructured":"N.KarmarkarandL. P.Sinha Application of Karmarkar's algorithm to overseas telecommunications facility planning. Paper presented at XII International Symposium on Mathematical Programming Boston MA."},{"key":"e_1_2_1_17_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E.","year":"1976"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_2_1_19_2","volume-title":"Mathematical Programming: Theory and Applications","author":"Minoux M.","year":"1986"},{"key":"e_1_2_1_20_2","first-page":"283","article-title":"Network synthesis and dynamic network optimization","volume":"31","author":"Minoux M.","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_21_2","volume-title":"Linear Programming","author":"Murty K. G.","year":"1983"},{"key":"e_1_2_1_22_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.22.1.87"},{"key":"e_1_2_1_24_2","unstructured":"G. G.Polak Multihour multicommodity design synthesis under queuing demand for flows. PhD Dissertation Carnegie Mellon University Pittsburgh (April1983)."},{"key":"e_1_2_1_25_2","unstructured":"G. G.Polak Primal\u2010dual synthesis of a multiperiod telecommunications network. Manuscript MSIS Wright State University Dayton OH 45435 (1991)."},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90007-1"},{"key":"e_1_2_1_27_2","volume-title":"A simplex solution to the minimum cost nonsimultaneous multi\u2010commodity flow problem","author":"Rioux P.","year":"1989"},{"key":"e_1_2_1_28_2","volume-title":"Graphs, Networks, and Algorithms","author":"Swamy M. N. S.","year":"1981"},{"key":"e_1_2_1_29_2","volume-title":"Data Structures and Network Algorithms","author":"Tarjan R. E.","year":"1984"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T08:50:12Z","timestamp":1698051012000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["10.1002\/net.3230220306"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220306","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}