{"id":"https://openalex.org/W2570329970","doi":"https://doi.org/10.1109/cdc.2016.7799446","title":"Multi-player minimum cost flow problems with nonconvex costs and integer flows","display_name":"Multi-player minimum cost flow problems with nonconvex costs and integer flows","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2570329970","doi":"https://doi.org/10.1109/cdc.2016.7799446","mag":"2570329970"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2016.7799446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7799446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th 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/A5025454489","display_name":"Shuvomoy Das Gupta","orcid":"https://orcid.org/0000-0001-9650-8746"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I75717288","display_name":"Rogers (United States)","ror":"https://ror.org/05m9vrv91","country_code":"US","type":"company","lineage":["https://openalex.org/I75717288"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Shuvomoy Das Gupta","raw_affiliation_strings":["Edward S. Rogers Department of Electrical and Computer Engineering, University of Toronto"],"affiliations":[{"raw_affiliation_string":"Edward S. Rogers Department of Electrical and Computer Engineering, University of Toronto","institution_ids":["https://openalex.org/I75717288","https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038039270","display_name":"Lacra Pavel","orcid":"https://orcid.org/0000-0002-2849-0318"},"institutions":[{"id":"https://openalex.org/I75717288","display_name":"Rogers (United States)","ror":"https://ror.org/05m9vrv91","country_code":"US","type":"company","lineage":["https://openalex.org/I75717288"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Lacra Pavel","raw_affiliation_strings":["Edward S. Rogers Department of Electrical and Computer Engineering, University of Toronto"],"affiliations":[{"raw_affiliation_string":"Edward S. Rogers Department of Electrical and Computer Engineering, University of Toronto","institution_ids":["https://openalex.org/I75717288","https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025454489"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I75717288"],"apc_list":null,"apc_paid":null,"fwci":1.0266,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89040065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":null,"first_page":"7617","last_page":"7622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9962000250816345,"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.9833999872207642,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7814509868621826},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6601075530052185},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5876045823097229},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5428540706634521},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5354661345481873},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5275366306304932},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5191116333007812},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48699790239334106},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.46931716799736023},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41936302185058594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36797064542770386}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7814509868621826},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6601075530052185},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5876045823097229},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5428540706634521},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5354661345481873},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5275366306304932},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5191116333007812},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48699790239334106},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.46931716799736023},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41936302185058594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36797064542770386},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2016.7799446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7799446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W133707965","https://openalex.org/W1606743527","https://openalex.org/W1762430620","https://openalex.org/W1977545325","https://openalex.org/W1983895252","https://openalex.org/W2011039300","https://openalex.org/W2016642097","https://openalex.org/W2044028040","https://openalex.org/W2053678873","https://openalex.org/W2065305730","https://openalex.org/W2067050450","https://openalex.org/W2088163136","https://openalex.org/W2091485235","https://openalex.org/W2096586036","https://openalex.org/W2157924277","https://openalex.org/W2171985270","https://openalex.org/W2291146841","https://openalex.org/W2913535645","https://openalex.org/W2935852545","https://openalex.org/W4213060235","https://openalex.org/W4234426551","https://openalex.org/W4250589301","https://openalex.org/W6758920291"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W1925942709","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W2047683846","https://openalex.org/W2044902158"],"abstract_inverted_index":{"In":[0,70],"this":[1,71],"paper":[2],"we":[3,34,165],"consider":[4],"a":[5,16,30,74,92,124,139,174],"variant":[6],"of":[7,41,46,126,129,146,158],"the":[8,27,42,58,62,66,100,120,130,144,152,156,159],"well":[9],"known":[10],"minimum":[11],"cost":[12,54],"flow":[13,60,68],"problem":[14,28,101,137],"in":[15,29,102,138],"directed":[17],"network":[18,67],"with":[19,38],"nonconvex":[20,53],"costs":[21],"and":[22],"integer":[23,59],"flows.":[24],"We":[25,86,96,142],"formulate":[26],"multi-player":[31,72],"setup,":[32,73],"whereby":[33],"associate":[35],"one":[36],"player":[37,48],"each":[39,47],"arc":[40,63],"network.":[43],"The":[44],"goal":[45],"is":[49,78],"to":[50,65,80,90,150,172],"minimize":[51],"its":[52,103,135],"that":[55,118],"depends":[56],"on":[57,169],"through":[61],"subject":[64],"constraints.":[69,163],"Pareto":[75,93,175],"optimal":[76,94,176],"point":[77],"justified":[79],"be":[81],"an":[82,88,114],"efficient":[83],"solution":[84],"concept.":[85],"propose":[87],"algorithm":[89],"compute":[91],"point.":[95,177],"show":[97],"that,":[98],"although":[99],"original":[104],"form":[105],"has":[106],"coupled":[107],"constraints":[108],"binding":[109],"every":[110],"player,":[111],"there":[112],"exists":[113],"equivalent":[115],"variable":[116],"transformation":[117],"decouples":[119],"optimization":[121,136,153],"problems":[122,154],"for":[123,155],"number":[125],"players.":[127],"Each":[128],"decoupled":[131,148],"players":[132,149,160],"can":[133],"solve":[134],"decentralized":[140],"manner.":[141],"use":[143],"solutions":[145],"those":[147],"transform":[151],"rest":[157],"using":[161],"consensus":[162],"Then":[164],"present":[166],"algorithms":[167],"based":[168],"algebraic":[170],"geometry":[171],"find":[173]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}