{"id":"https://openalex.org/W2020452932","doi":"https://doi.org/10.1145/1345375.1345414","title":"An alternative dynamic programming solution for the 0/1 knapsack","display_name":"An alternative dynamic programming solution for the 0/1 knapsack","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2020452932","doi":"https://doi.org/10.1145/1345375.1345414","mag":"2020452932"},"language":"en","primary_location":{"id":"doi:10.1145/1345375.1345414","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1345375.1345414","pdf_url":null,"source":{"id":"https://openalex.org/S4210170956","display_name":"ACM SIGCSE Bulletin","issn_l":"0097-8418","issn":["0097-8418","2331-3927"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCSE Bulletin","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/A5010456030","display_name":"Timothy J. Rolfe","orcid":null},"institutions":[{"id":"https://openalex.org/I159107703","display_name":"Eastern Washington University","ror":"https://ror.org/002g57a93","country_code":"US","type":"education","lineage":["https://openalex.org/I159107703"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy J. Rolfe","raw_affiliation_strings":["Eastern Washington University, Cheney, Washington","Eastern Washington University, Cheney,#R# Washington"],"affiliations":[{"raw_affiliation_string":"Eastern Washington University, Cheney, Washington","institution_ids":["https://openalex.org/I159107703"]},{"raw_affiliation_string":"Eastern Washington University, Cheney,#R# Washington","institution_ids":["https://openalex.org/I159107703"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010456030"],"corresponding_institution_ids":["https://openalex.org/I159107703"],"apc_list":null,"apc_paid":null,"fwci":0.81022543,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77012758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"39","issue":"4","first_page":"54","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9341999888420105,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9341999888420105,"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/T11269","display_name":"Algorithms and Data Compression","score":0.926800012588501,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9961084127426147},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8161376118659973},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.7950608134269714},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6157025098800659},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5509190559387207},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5504964590072632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.53615802526474},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5218145251274109},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4206704795360565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3406074643135071},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.1711852252483368}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9961084127426147},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8161376118659973},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7950608134269714},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6157025098800659},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5509190559387207},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5504964590072632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.53615802526474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5218145251274109},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4206704795360565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3406074643135071},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.1711852252483368},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1345375.1345414","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1345375.1345414","pdf_url":null,"source":{"id":"https://openalex.org/S4210170956","display_name":"ACM SIGCSE Bulletin","issn_l":"0097-8418","issn":["0097-8418","2331-3927"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCSE Bulletin","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310235","display_name":"Eastern Washington University","ror":"https://ror.org/002g57a93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W67059538","https://openalex.org/W67380834","https://openalex.org/W122148028","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W2005493932","https://openalex.org/W2381035939","https://openalex.org/W2087209118","https://openalex.org/W4249611560","https://openalex.org/W2122137596","https://openalex.org/W2168163332","https://openalex.org/W2993365626","https://openalex.org/W4256002267"],"abstract_inverted_index":{"The":[0,23],"0/1":[1],"knapsack":[2,4,37,40,51],"(or":[3],"without":[5],"repetition)":[6,54],"has":[7],"a":[8,14,31],"dynamic":[9],"programming":[10],"solution":[11,47,61],"driven":[12],"by":[13,29],"table":[15,32],"in":[16,33,56,65],"which":[17,34],"each":[18,39],"item":[19],"is":[20,42],"consecutively":[21],"considered.":[22],"problem":[24],"can":[25],"also":[26],"be":[27],"approached":[28],"generating":[30],"the":[35,46,49,60],"optimal":[36],"for":[38],"capacity":[41],"generated,":[43],"modeled":[44],"on":[45],"to":[48,62],"integer":[50],"(knapsack":[52],"with":[53],"found":[55,64],"Sedgewick":[57],"[1]":[58],"and":[59],"change-making":[63],"Ciubatii":[66],"[2].":[67]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}