{"id":"https://openalex.org/W3082797755","doi":"https://doi.org/10.1109/med48518.2020.9183012","title":"A Dynamic Programming Approach for the Decentralized Control of Discrete Optimizers with Quadratic Utilities and Shared Constraint","display_name":"A Dynamic Programming Approach for the Decentralized Control of Discrete Optimizers with Quadratic Utilities and Shared Constraint","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3082797755","doi":"https://doi.org/10.1109/med48518.2020.9183012","mag":"3082797755"},"language":"en","primary_location":{"id":"doi:10.1109/med48518.2020.9183012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med48518.2020.9183012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 28th Mediterranean Conference on Control and Automation (MED)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5038870263","display_name":"Raffaele Carli","orcid":"https://orcid.org/0000-0001-9184-6017"},"institutions":[{"id":"https://openalex.org/I68618741","display_name":"Polytechnic University of Bari","ror":"https://ror.org/03c44v465","country_code":"IT","type":"education","lineage":["https://openalex.org/I68618741"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Carli","raw_affiliation_strings":["Department of Electrical and Information Engineering, Polytechnic of Bari, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Engineering, Polytechnic of Bari, Italy","institution_ids":["https://openalex.org/I68618741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013936778","display_name":"Mariagrazia Dotoli","orcid":"https://orcid.org/0000-0003-1459-3452"},"institutions":[{"id":"https://openalex.org/I68618741","display_name":"Polytechnic University of Bari","ror":"https://ror.org/03c44v465","country_code":"IT","type":"education","lineage":["https://openalex.org/I68618741"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mariagrazia Dotoli","raw_affiliation_strings":["Department of Electrical and Information Engineering, Polytechnic of Bari, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Engineering, Polytechnic of Bari, Italy","institution_ids":["https://openalex.org/I68618741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I68618741"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10444421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"611","last_page":"616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9965000152587891,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.704113245010376},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6318978071212769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5280756950378418},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4829482436180115},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46599045395851135},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.43768033385276794},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41071683168411255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37764424085617065}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.704113245010376},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6318978071212769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5280756950378418},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4829482436180115},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46599045395851135},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.43768033385276794},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41071683168411255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37764424085617065},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/med48518.2020.9183012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med48518.2020.9183012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 28th Mediterranean Conference on Control and Automation (MED)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W563824333","https://openalex.org/W1601081659","https://openalex.org/W1988967059","https://openalex.org/W2082782506","https://openalex.org/W2093067798","https://openalex.org/W2098432798","https://openalex.org/W2102688226","https://openalex.org/W2105339579","https://openalex.org/W2123981023","https://openalex.org/W2164056371","https://openalex.org/W2296319761","https://openalex.org/W2430650957","https://openalex.org/W2487144912","https://openalex.org/W2579255320","https://openalex.org/W2588764884","https://openalex.org/W2784231771","https://openalex.org/W2891124923","https://openalex.org/W2914313642","https://openalex.org/W2994472006","https://openalex.org/W3012347766","https://openalex.org/W3100137821","https://openalex.org/W4210823377","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W1966986652","https://openalex.org/W2142105839","https://openalex.org/W1563501581","https://openalex.org/W4389887952","https://openalex.org/W4391505986","https://openalex.org/W2367132302"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,47,53,64,86,94,125,132,146,149,152],"problem":[4,34,65],"of":[5,10,77,88,124,148,155],"controlling":[6],"a":[7,14,33,58,74,81,89,104,135],"large":[8],"set":[9],"agents,":[11],"each":[12],"with":[13,113],"quadratic":[15,42],"utility":[16],"function":[17],"depending":[18],"on":[19,29,103],"individual":[20],"combinatorial":[21],"choices,":[22],"and":[23,116,122],"all":[24],"sharing":[25],"an":[26,38],"affine":[27],"constraint":[28],"available":[30],"resources.":[31],"Such":[32],"is":[35],"formulated":[36],"as":[37],"integer":[39],"mono-constrained":[40],"bounded":[41],"knapsack":[43],"problem.":[44],"Differently":[45],"from":[46],"centralized":[48],"approaches":[49],"typically":[50],"proposed":[51,100],"in":[52,67,151],"related":[54],"literature,":[55],"we":[56],"present":[57],"new":[59],"decentralized":[60,105],"algorithm":[61,107,133],"to":[62,144],"solve":[63],"approximately":[66],"polynomial":[68,137],"time":[69],"by":[70],"decomposing":[71],"it":[72],"into":[73],"finite":[75],"series":[76],"sub-problems.":[78],"We":[79],"assume":[80],"minimal":[82],"communication":[83],"structure":[84],"through":[85],"presence":[87],"central":[90],"coordinator":[91],"that":[92,108,131],"ensures":[93],"information":[95],"exchange":[96],"between":[97],"agents.":[98],"The":[99,120],"solution":[101],"relies":[102],"control":[106],"combines":[109],"discrete":[110],"dynamic":[111],"programming":[112],"additive":[114],"decomposition":[115],"value":[117],"functions":[118],"approximation.":[119],"optimality":[121],"complexity":[123],"presented":[126,143],"strategy":[127],"are":[128,142],"discussed,":[129],"highlighting":[130],"constitutes":[134],"fully":[136],"approximation":[138],"scheme.":[139],"Numerical":[140],"experiments":[141],"show":[145],"effectiveness":[147],"approach":[150],"optimal":[153],"resolution":[154],"large-scale":[156],"instances.":[157]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}