{"id":"https://openalex.org/W2057750651","doi":"https://doi.org/10.1007/bf01299450","title":"A generic auction algorithm for the minimum cost network flow problem","display_name":"A generic auction algorithm for the minimum cost network flow problem","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W2057750651","doi":"https://doi.org/10.1007/bf01299450","mag":"2057750651"},"language":"en","primary_location":{"id":"doi:10.1007/bf01299450","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01299450","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/3247","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitri P. Bertsekas","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, M.I.T., 02139, Cambridge, MA","Department of Electrical Engineering and Computer Science, M.I.T., Cambridge"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, M.I.T., 02139, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, M.I.T., Cambridge","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003437594","display_name":"David A. Casta\ufffdon","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":false,"raw_author_name":"David A. Casta\ufffdon","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, Boston,"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, Boston,","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039911471"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.569,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.68517144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":"3","first_page":"229","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9901000261306763,"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.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7333375215530396},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.7279427647590637},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.7007096409797668},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5690696239471436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5265949964523315},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.5054118633270264},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.48984143137931824},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.48006781935691833},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.478588342666626},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4740604758262634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4680946171283722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44691216945648193},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4237940311431885},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4105414152145386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25651049613952637},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2473498284816742},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.20046457648277283},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.13414770364761353},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09049224853515625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08451524376869202},{"id":"https://openalex.org/keywords/revenue-equivalence","display_name":"Revenue equivalence","score":0.07087543606758118}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7333375215530396},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.7279427647590637},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7007096409797668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5690696239471436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5265949964523315},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.5054118633270264},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.48984143137931824},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.48006781935691833},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.478588342666626},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4740604758262634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4680946171283722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44691216945648193},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4237940311431885},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4105414152145386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25651049613952637},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2473498284816742},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.20046457648277283},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.13414770364761353},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09049224853515625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08451524376869202},{"id":"https://openalex.org/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.07087543606758118},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01299450","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01299450","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/3247","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/3247","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/3247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1493391054","https://openalex.org/W1561880747","https://openalex.org/W1595834735","https://openalex.org/W1603765807","https://openalex.org/W1861813983","https://openalex.org/W1964160573","https://openalex.org/W1964486323","https://openalex.org/W1964540128","https://openalex.org/W1970403725","https://openalex.org/W2001274023","https://openalex.org/W2009070933","https://openalex.org/W2014995991","https://openalex.org/W2033982221","https://openalex.org/W2035934281","https://openalex.org/W2038828004","https://openalex.org/W2039651888","https://openalex.org/W2044973895","https://openalex.org/W2053913299","https://openalex.org/W2057265280","https://openalex.org/W2059616758","https://openalex.org/W2061670230","https://openalex.org/W2061872629","https://openalex.org/W2068310603","https://openalex.org/W2069323107","https://openalex.org/W2097732389","https://openalex.org/W2117371776","https://openalex.org/W2119234846","https://openalex.org/W2119312244","https://openalex.org/W2142959090","https://openalex.org/W2144050074","https://openalex.org/W2146131395","https://openalex.org/W2406288514","https://openalex.org/W2692373750","https://openalex.org/W4230397637","https://openalex.org/W4285719527","https://openalex.org/W4300533730"],"related_works":["https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W3141113327","https://openalex.org/W2531764854","https://openalex.org/W2625547693","https://openalex.org/W2355612523","https://openalex.org/W2051329268","https://openalex.org/W2366102085"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}