{"id":"https://openalex.org/W2091485235","doi":"https://doi.org/10.1109/cdc.2012.6426480","title":"Accelerated dual coordinate algorithms for separable convex cost network flow problems","display_name":"Accelerated dual coordinate algorithms for separable convex cost network flow problems","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2091485235","doi":"https://doi.org/10.1109/cdc.2012.6426480","mag":"2091485235"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6426480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5086188217","display_name":"Ajay Kumar Bangla","orcid":null},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ajay Kumar Bangla","raw_affiliation_strings":["Dept of Electrical & Computer Eng., Boston University","Dept of Electrical and Computer Engineering, Boston University, USA"],"affiliations":[{"raw_affiliation_string":"Dept of Electrical & Computer Eng., Boston University","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Dept of Electrical and Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Castanon","raw_affiliation_strings":["Boston University, Boston, MA, US","Dept of Electrical and Computer Engineering, Boston University, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, US","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Dept of Electrical and Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086188217"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.5123,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78844036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"4468","last_page":"4473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6804007887840271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085461378097534},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5669401288032532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.549107015132904},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5442587733268738},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5182311534881592},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5046921968460083},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.49694064259529114},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4657949209213257},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46458083391189575},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.45124551653862},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42939993739128113},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3853335380554199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2634851932525635}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6804007887840271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085461378097534},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5669401288032532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.549107015132904},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5442587733268738},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5182311534881592},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5046921968460083},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.49694064259529114},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4657949209213257},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46458083391189575},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.45124551653862},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42939993739128113},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3853335380554199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2634851932525635},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2012.6426480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W228547482","https://openalex.org/W1542339055","https://openalex.org/W1573199930","https://openalex.org/W1582098563","https://openalex.org/W1964486323","https://openalex.org/W1985236000","https://openalex.org/W1997996213","https://openalex.org/W2015163868","https://openalex.org/W2035934281","https://openalex.org/W2061670230","https://openalex.org/W2100157068","https://openalex.org/W2117371776","https://openalex.org/W2141818029"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W648253840","https://openalex.org/W2051329268","https://openalex.org/W2092572272"],"abstract_inverted_index":{"Nonlinear":[0],"network":[1,18,65],"flow":[2,66],"problems":[3,7,32,146],"are":[4,38,54],"convex":[5,45,63],"minimization":[6],"that":[8,37,95,124,149],"arise":[9],"in":[10,114],"diverse":[11],"applications":[12],"from":[13],"transportation":[14],"to":[15,84],"finance.":[16],"The":[17],"structure":[19],"of":[20,26,31,40,103,166],"the":[21,24,56,75,101,104,115,132,137,158],"constraints":[22],"and":[23,80,130],"separability":[25],"objectives":[27],"make":[28,85],"this":[29,69],"class":[30],"suitable":[33],"for":[34,59,118],"special":[35],"algorithms":[36,50],"orders":[39],"magnitude":[41],"faster":[42],"than":[43],"standard":[44],"optimization":[46],"methods.":[47],"Dual":[48],"coordinate":[49],"such":[51,61,97],"as":[52,136],"\u0454-relaxation":[53,76,106,167],"among":[55],"fastest":[57],"methods":[58],"solving":[60],"separable":[62],"cost":[64],"problems.":[67,121],"In":[68],"paper,":[70],"we":[71,147],"identify":[72],"conditions":[73,98],"where":[74],"algorithm":[77,94,117,127,152,160],"is":[78,109,128],"inefficient":[79],"requires":[81],"many":[82,164],"iterations":[83],"progress":[86],"towards":[87],"convergence.":[88],"We":[89,122],"subsequently":[90],"develop":[91],"a":[92,169],"new":[93,126,151],"avoids":[96],"while":[99],"preserving":[100],"advantages":[102],"original":[105,138,159],"algorithm.":[107,139],"It":[108],"inspired":[110],"by":[111,168],"techniques":[112],"used":[113],"auction":[116],"linear":[119],"assignment":[120],"show":[123],"our":[125,150],"correct":[129],"shares":[131],"same":[133],"worst-case":[134],"complexity":[135],"Through":[140],"extensive":[141],"numerical":[142],"experiments":[143],"on":[144],"benchmark":[145],"demonstrate":[148],"significantly":[153],"reduces":[154],"computation":[155],"times":[156],"over":[157],"because":[161],"it":[162],"replaces":[163],"steps":[165],"single":[170],"large":[171],"step.":[172]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}