{"id":"https://openalex.org/W2147881012","doi":"https://doi.org/10.1007/978-3-642-01129-0_84","title":"The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation","display_name":"The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2147881012","doi":"https://doi.org/10.1007/978-3-642-01129-0_84","mag":"2147881012"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-01129-0_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-01129-0_84","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5068859002","display_name":"Philipp Rohlfshagen","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Philipp Rohlfshagen","raw_affiliation_strings":["The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA) School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA) School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA) School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA) School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068859002"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8683,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.76377894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"745","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987000226974487,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987000226974487,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9869999885559082,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9656979441642761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7894346117973328},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7336626648902893},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5898847579956055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5804879069328308},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.46573343873023987},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4599863588809967},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.44305935502052307},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3494867980480194},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3196873664855957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2745608687400818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14799246191978455}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9656979441642761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7894346117973328},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7336626648902893},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5898847579956055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5804879069328308},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.46573343873023987},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4599863588809967},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.44305935502052307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3494867980480194},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3196873664855957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2745608687400818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14799246191978455},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-01129-0_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-01129-0_84","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/606eba98-5219-4c90-be33-a61a84359520","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/606eba98-5219-4c90-be33-a61a84359520","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rohlfshagen, P, Yao, X, Giacobini, M, Brabazon, A, Cagnoni, S, Caro, C, Esparcia-Alc\u00e1zar, AI, Farooq, M, Fink, A, Machado, P, McCormack, J, O'Neill, M, Neri, F, Preu\u00df, M, Rothlauf, F, Tarantino, E & Yang, S 2009, 'The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation', pp. 745-754. https://doi.org/10.1007/978-3-642-01129-0_84","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3295527180","display_name":null,"funder_award_id":"EP/E058884/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W133440180","https://openalex.org/W1498124058","https://openalex.org/W1507811735","https://openalex.org/W1523699031","https://openalex.org/W1570270745","https://openalex.org/W1574175429","https://openalex.org/W1599522635","https://openalex.org/W1604213398","https://openalex.org/W1831084602","https://openalex.org/W1933385826","https://openalex.org/W1992339380","https://openalex.org/W2011039300","https://openalex.org/W2047845563","https://openalex.org/W2093083775","https://openalex.org/W2100765697","https://openalex.org/W2102219905","https://openalex.org/W2104360703","https://openalex.org/W2127172809","https://openalex.org/W2129539033","https://openalex.org/W2134412067","https://openalex.org/W2143072546","https://openalex.org/W2152118235","https://openalex.org/W2156106639","https://openalex.org/W2160958384","https://openalex.org/W2165978911","https://openalex.org/W2406162063","https://openalex.org/W2476096155","https://openalex.org/W2626488222","https://openalex.org/W4206085891","https://openalex.org/W4239127116","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W179363847","https://openalex.org/W2993365626","https://openalex.org/W4312222677","https://openalex.org/W2087209118","https://openalex.org/W3171554204","https://openalex.org/W4365514833","https://openalex.org/W2154662456","https://openalex.org/W4282006399","https://openalex.org/W128408443","https://openalex.org/W1534513247"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}