{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:22Z","timestamp":1698127822527},"reference-count":6,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5428,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1991,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a primal\u2010dual algorithm for solving the minimum average weighted length circuit problem. The algorithm solves the problem by solving a series of subproblems with more combinatorial aspects iteratively. We also prove that the complexity of the algorithm is <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>4<\/jats:sup> max{<jats:italic>t<jats:sub>ij<\/jats:sub><\/jats:italic>}) and show that our algorithm is actually a generalization of the Karp\u2013Orlin algorithm. Finally, the relationship between the two algorithms is discussed.<\/jats:p>","DOI":"10.1002\/net.3230210702","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T11:50:05Z","timestamp":1178970605000},"page":"705-712","source":"Crossref","is-referenced-by-count":2,"title":["A primal\u2010dual algorithm for the minimum average weighted length circuit problem"],"prefix":"10.1002","volume":"21","author":[{"given":"Chengen","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dayong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1962.10"},{"key":"e_1_2_1_3_2","first-page":"77","volume-title":"Theory of Graphs","author":"Dantzig G. B.","year":"1967"},{"key":"e_1_2_1_4_2","first-page":"61","volume-title":"Graphs and Algorithms","author":"Gondran M.","year":"1984"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90026-3"},{"key":"e_1_2_1_6_2","first-page":"94","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_7_2","first-page":"105","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230210702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230210702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T03:04:50Z","timestamp":1698030290000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230210702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":6,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["10.1002\/net.3230210702"],"URL":"https:\/\/doi.org\/10.1002\/net.3230210702","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}