{"id":"https://openalex.org/W1968615825","doi":"https://doi.org/10.1002/net.3230210702","title":"A primal\u2010dual algorithm for the minimum average weighted length circuit problem","display_name":"A primal\u2010dual algorithm for the minimum average weighted length circuit problem","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W1968615825","doi":"https://doi.org/10.1002/net.3230210702","mag":"1968615825"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230210702","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210702","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019469698","display_name":"Cheng'en Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chengen Yang","raw_affiliation_strings":["Research Department, Changsha Railway Institute, Changsha, Hunan, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Department, Changsha Railway Institute, Changsha, Hunan, People's Republic of China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100633582","display_name":"Dayong Jin","orcid":"https://orcid.org/0000-0003-1046-2666"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dayong Jin","raw_affiliation_strings":["Research Department, Changsha Railway Institute, Changsha, Hunan, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Department, Changsha Railway Institute, Changsha, Hunan, People's Republic of China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.09062144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"7","first_page":"705","last_page":"712"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9818999767303467,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7001056671142578},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5926240086555481},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5792139768600464},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5236135125160217},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4773017168045044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36204248666763306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3397730588912964}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7001056671142578},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5926240086555481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5792139768600464},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5236135125160217},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4773017168045044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36204248666763306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3397730588912964},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230210702","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210702","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1969625919","https://openalex.org/W2053913299","https://openalex.org/W2074493271","https://openalex.org/W2125690626"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2080152487","https://openalex.org/W2544423928","https://openalex.org/W2052122378","https://openalex.org/W2239445980"],"abstract_inverted_index":{"Abstract":[0],"We":[1,31],"present":[2],"a":[3,22,56],"primal\u2010dual":[4],"algorithm":[5,16,39,53],"for":[6],"solving":[7,21],"the":[8,18,35,38,59,63,66],"minimum":[9],"average":[10],"weighted":[11],"length":[12],"circuit":[13],"problem.":[14],"The":[15],"solves":[17],"problem":[19],"by":[20],"series":[23],"of":[24,37,58],"subproblems":[25],"with":[26],"more":[27],"combinatorial":[28],"aspects":[29],"iteratively.":[30],"also":[32],"prove":[33],"that":[34,51],"complexity":[36],"is":[40,54,69],"O":[41],"(":[42],"n":[43],"4":[44],"max{":[45],"t":[46],"ij":[47],"})":[48],"and":[49],"show":[50],"our":[52],"actually":[55],"generalization":[57],"Karp\u2013Orlin":[60],"algorithm.":[61],"Finally,":[62],"relationship":[64],"between":[65],"two":[67],"algorithms":[68],"discussed.":[70]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}