{"id":"https://openalex.org/W2045721235","doi":"https://doi.org/10.1137/0803025","title":"An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks","display_name":"An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks","publication_year":1993,"publication_date":"1993-08-01","ids":{"openalex":"https://openalex.org/W2045721235","doi":"https://doi.org/10.1137/0803025","mag":"2045721235"},"language":"en","primary_location":{"id":"doi:10.1137/0803025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803025","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mauricio G. C. Resende","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021921216","display_name":"Geraldo Veiga","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geraldo Veiga","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029261812"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3491,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.8915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"3","first_page":"516","last_page":"537"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9966999888420105,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/mathematics","display_name":"Mathematics","score":0.7211503982543945},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6318148374557495},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.6157825589179993},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.6054539680480957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5564391016960144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5393971800804138},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.49607524275779724},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47232693433761597},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4509928524494171},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.42718249559402466},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4157774746417999},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.29775065183639526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16626834869384766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10762763023376465}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7211503982543945},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6318148374557495},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.6157825589179993},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.6054539680480957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5564391016960144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5393971800804138},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.49607524275779724},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47232693433761597},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4509928524494171},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.42718249559402466},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4157774746417999},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.29775065183639526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16626834869384766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10762763023376465},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0803025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803025","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.8456","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.8456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mgcr/doc/dlasg.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1964540128","https://openalex.org/W1965680834","https://openalex.org/W1981053712","https://openalex.org/W1982967176","https://openalex.org/W2002576214","https://openalex.org/W2033982221","https://openalex.org/W2052321453","https://openalex.org/W2052666350","https://openalex.org/W2057185554","https://openalex.org/W2057265280","https://openalex.org/W2057869046","https://openalex.org/W2078519610","https://openalex.org/W2094291659","https://openalex.org/W2146371908","https://openalex.org/W2316564661","https://openalex.org/W2326954772","https://openalex.org/W4230397637"],"related_works":["https://openalex.org/W2159515580","https://openalex.org/W2081820376","https://openalex.org/W2091325992","https://openalex.org/W2059625160","https://openalex.org/W2006453807","https://openalex.org/W2740546554","https://openalex.org/W25030584","https://openalex.org/W4233917719","https://openalex.org/W2730708452","https://openalex.org/W2151960844"],"abstract_inverted_index":{"This":[0,24,142],"paper":[1],"describes":[2],"an":[3,68,93,100],"implementation":[4,25,114,149],"of":[5,36,47,67,74,87,110,122],"the":[6,34,41,48,64,75,88,97,108,131,137,155,159,167],"dual":[7,78,111],"affine":[8],"scaling":[9],"algorithm":[10,31,139,145],"for":[11,84],"linear":[12,37],"programming":[13],"specialized":[14],"to":[15,32,96],"solve":[16,33],"minimum-cost":[17],"flow":[18],"problems":[19],"on":[20,63],"bipartite":[21],"uncapacitated":[22],"networks.":[23],"uses":[26],"a":[27,56,60,151],"preconditioned":[28],"conjugate":[29],"gradient":[30],"system":[35],"equations":[38],"that":[39],"determines":[40],"search":[42],"direction":[43],"at":[44],"each":[45],"iteration":[46],"interior":[49,143,160],"point":[50,144,161],"algorithm.":[51],"Two":[52],"preconditioners":[53],"are":[54],"considered:":[55],"diagonal":[57],"preconditioner":[58,61],"and":[59,136,169],"based":[62],"incidence":[65],"matrix":[66],"approximate":[69],"maximum":[70],"weighted":[71],"spanning":[72,81],"tree":[73,82],"network.":[76],"Under":[77],"nondegeneracy":[79],"this":[80],"allows":[83],"early":[85],"identification":[86],"optimal":[89,101],"solution.":[90],"By":[91],"applying":[92],"$\\epsilon":[94],"$-perturbation":[95],"cost":[98],"vector,":[99],"extreme-point":[102],"primal":[103],"solution":[104,128],"is":[105,115],"produced":[106],"in":[107,150],"presence":[109],"degeneracy.":[112],"The":[113],"tested":[116,158],"by":[117],"solving":[118],"several":[119],"large":[120],"instances":[121,157],"randomly":[123],"generated":[124],"assignment":[125],"problems,":[126],"comparing":[127],"times":[129],"with":[130,165],"network":[132],"simplex":[133,168],"code":[134,140,162],"NETFLO":[135],"relaxation":[138,170],"RELAX.":[141],"greatly":[146],"benefits":[147],"from":[148],"parallel":[152],"architecture.":[153],"For":[154],"largest":[156],"was":[163],"competitive":[164],"both":[166],"codes.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}