{"id":"https://openalex.org/W2983116590","doi":"https://doi.org/10.1080/00207179.2019.1694178","title":"Allocating resources via price management systems: a dynamic programming-based approach","display_name":"Allocating resources via price management systems: a dynamic programming-based approach","publication_year":2019,"publication_date":"2019-11-18","ids":{"openalex":"https://openalex.org/W2983116590","doi":"https://doi.org/10.1080/00207179.2019.1694178","mag":"2983116590"},"language":"en","primary_location":{"id":"doi:10.1080/00207179.2019.1694178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207179.2019.1694178","pdf_url":null,"source":{"id":"https://openalex.org/S88061139","display_name":"International Journal of Control","issn_l":"0020-7179","issn":["0020-7179","1366-5820"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Control","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/A5011300414","display_name":"Ali Forootani","orcid":"https://orcid.org/0000-0001-7612-4016"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Ali Forootani","raw_affiliation_strings":["Department of Engineering, University of Sannio, Benevento, Italy"],"raw_orcid":"https://orcid.org/0000-0001-7612-4016","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061224523","display_name":"Davide Liuzza","orcid":"https://orcid.org/0000-0003-1791-2295"},"institutions":[{"id":"https://openalex.org/I110120368","display_name":"National Agency for New Technologies, Energy and Sustainable Economic Development","ror":"https://ror.org/02an8es95","country_code":"IT","type":"government","lineage":["https://openalex.org/I110120368"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Davide Liuzza","raw_affiliation_strings":["Fusion and Nuclear Safety Department, ENEA, Frascati (Rome), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fusion and Nuclear Safety Department, ENEA, Frascati (Rome), Italy","institution_ids":["https://openalex.org/I110120368"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053554951","display_name":"Massimo Tipaldi","orcid":"https://orcid.org/0000-0003-4003-1613"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Tipaldi","raw_affiliation_strings":["Department of Engineering, University of Sannio, Benevento, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4003-1613","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011562075","display_name":"Luigi Glielmo","orcid":"https://orcid.org/0000-0003-2753-1787"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luigi Glielmo","raw_affiliation_strings":["Department of Engineering, University of Sannio, Benevento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011300414"],"corresponding_institution_ids":["https://openalex.org/I16337185"],"apc_list":null,"apc_paid":null,"fwci":0.867,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81484149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"94","issue":"8","first_page":"2123","last_page":"2143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.8042591214179993},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.7756892442703247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.713363528251648},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6713253855705261},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.6089463233947754},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4814162254333496},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4685061275959015},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.43510276079177856},{"id":"https://openalex.org/keywords/reservation-price","display_name":"Reservation price","score":0.4182594418525696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17232397198677063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12387445569038391}],"concepts":[{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.8042591214179993},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7756892442703247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.713363528251648},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6713253855705261},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6089463233947754},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4814162254333496},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4685061275959015},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.43510276079177856},{"id":"https://openalex.org/C70295763","wikidata":"https://www.wikidata.org/wiki/Q474606","display_name":"Reservation price","level":2,"score":0.4182594418525696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17232397198677063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12387445569038391},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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.1080/00207179.2019.1694178","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207179.2019.1694178","pdf_url":null,"source":{"id":"https://openalex.org/S88061139","display_name":"International Journal of Control","issn_l":"0020-7179","issn":["0020-7179","1366-5820"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W1507222174","https://openalex.org/W1566552089","https://openalex.org/W1601081659","https://openalex.org/W1982107603","https://openalex.org/W2000850397","https://openalex.org/W2005374321","https://openalex.org/W2009650852","https://openalex.org/W2052307584","https://openalex.org/W2059752064","https://openalex.org/W2098432798","https://openalex.org/W2123786618","https://openalex.org/W2124477018","https://openalex.org/W2126316555","https://openalex.org/W2143026125","https://openalex.org/W2154150516","https://openalex.org/W2162569149","https://openalex.org/W2165418472","https://openalex.org/W2343114244","https://openalex.org/W2403425231","https://openalex.org/W2474005219","https://openalex.org/W2499714610","https://openalex.org/W2579927066","https://openalex.org/W2592309595","https://openalex.org/W2613665645","https://openalex.org/W2614119990","https://openalex.org/W2724541498","https://openalex.org/W2752215849","https://openalex.org/W2795276745","https://openalex.org/W2803281388","https://openalex.org/W2962759231","https://openalex.org/W4211136162","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W175006096","https://openalex.org/W2515165263","https://openalex.org/W2086136595","https://openalex.org/W2070315412","https://openalex.org/W1518635954","https://openalex.org/W2055621479","https://openalex.org/W2599556035","https://openalex.org/W1590308505","https://openalex.org/W4300052603","https://openalex.org/W2150542653"],"abstract_inverted_index":{"In":[0,99],"this":[1],"paper,":[2],"a":[3,40,52,111],"novel":[4],"model":[5],"for":[6,19,54,78],"price":[7,83],"management":[8],"systems":[9],"in":[10,121,134],"resource":[11,20,41,53],"allocation":[12],"problems":[13],"is":[14,92,108],"proposed.":[15],"Stochastic":[16,113],"customer":[17,38,50],"requests":[18],"allocations":[21],"and":[22,46,64,151],"releases":[23],"are":[24,76,132,141],"modelled":[25],"as":[26],"constrained":[27,112],"parallel":[28],"Birth\u2013Death":[29],"Processes":[30],"(BDP).":[31],"We":[32],"address":[33],"both":[34,62],"instant":[35],"(i.e.":[36,48],"the":[37,49,59,79,86,93,101,104,145,148,152],"requires":[39],"to":[42,143],"be":[43],"allocated":[44],"immediately)":[45],"advance":[47,124],"books":[51],"future":[55],"use)":[56],"reservation":[57,125],"requests,":[58],"latter":[60],"with":[61],"bounded":[63],"unbounded":[65],"time":[66],"interval":[67],"options.":[68],"Algorithms":[69],"based":[70],"on":[71],"Dynamic":[72,114,128],"Programming":[73,115,129],"(DP)":[74],"principles":[75],"proposed":[77,149],"calculation":[80],"of":[81,88,95,103,123,136,147],"suitable":[82],"profiles.":[84],"At":[85],"core":[87],"such":[89],"algorithms,":[90],"there":[91],"resolution":[94],"stochastic":[96],"optimisation":[97],"problems.":[98],"particular,":[100],"maximisation":[102],"expected":[105],"total":[106],"revenue":[107],"formulated":[109],"via":[110],"(SDP)":[116],"approach,":[117],"which":[118],"becomes":[119],"time-variant":[120],"case":[122,135],"requests.":[126],"Approximate":[127],"(ADP)":[130],"techniques":[131],"adopted":[133],"large":[137],"state":[138],"spaces.":[139],"Simulations":[140],"performed":[142],"show":[144],"effectiveness":[146],"models":[150],"related":[153],"algorithms.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}