{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:07:41Z","timestamp":1699834061022},"reference-count":20,"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":8715,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1982,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An extensive literature survey reveals that computational analyses of pure minimumcost\u2010network algorithms do not address the use of dual incremental codes. Previous studies only compare dual\u2010arc\u2010infeasible\u2010, primal\u2010dual\u2010, and primal\u2010type network codes. Of these three types, the primal method has been shown to be computationally superior to the other methods. This paper surveys the historical development of the dual incremental method up to and including the code DUALINC. Following a comprehensive description of DUALINC, a computational comparison is made with three other recently publicized codes, two primal codes and a dual\u2010arc\u2010infeasible code. The results of this comparison reveal that the new dual incremental code is much more efficient than the dual\u2010arc\u2010infeasible code and that it is competitive with the primal codes.<\/jats:p>","DOI":"10.1002\/net.3230120412","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T14:26:32Z","timestamp":1178893592000},"page":"475-492","source":"Crossref","is-referenced-by-count":5,"title":["An advanced dual incremental network algorithm"],"prefix":"10.1002","volume":"12","author":[{"given":"Stephen R.","family":"Schmidt","sequence":"first","affiliation":[]},{"given":"Paul A.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"J. Wesley","family":"Barnes","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"R. D.Armstrong D.Klingman andD.Whitman Implementation and analysis of a variant of the dual method for the capacitated transshipment problem. Research Report CCS324 Center for Cybernetic Studies The University of Texas at Austin 1978."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.1.1"},{"key":"e_1_2_1_4_2","volume-title":"A procedure for determining a family of minimal\u2010cost network flow patterns. ORO Technical Report 15, Operations Research Office","author":"Busaker R. G.","year":"1961"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_6_2","first-page":"16","article-title":"Matrixok kombinatorius tulafonsagairol","volume":"38","author":"Egervary E.","year":"1931","journal-title":"Mat. Fiz. Lapok"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800080308"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.2.171"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040302"},{"key":"e_1_2_1_11_2","unstructured":"F.GloverandD.Klingman An efficient dual approach to network problems. Working Paper 71\u201057 Graduate School of Business The University of Texas at Austin 1971."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"F.GloverandD.Klingman Improved labeling of L. P. bases in networks. Research Report CS218 Center for Cybernetic Studies The University of Texas at Austin 1974.","DOI":"10.21236\/ADA022692"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800130102"},{"key":"e_1_2_1_14_2","volume-title":"Network Flow Programming","author":"Jensen P. A.","year":"1980"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.6.631"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.814"},{"key":"e_1_2_1_17_2","volume-title":"Theorie der Endlichen und Undenlichen Graphen. Akademische","author":"Konig D.","year":"1936"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010107"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"e_1_2_1_21_2","unstructured":"S. R.Schmidt Development and computational analysis of a new dual incremental algorithm. Masters Report for M.S. in Mechanical Engineering The University of Texas at Austin 1980."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230120412","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230120412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:29:13Z","timestamp":1699795753000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230120412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["10.1002\/net.3230120412"],"URL":"https:\/\/doi.org\/10.1002\/net.3230120412","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}