{"id":"https://openalex.org/W2004942007","doi":"https://doi.org/10.1145/181983.181988","title":"Dynamic programming algorithms for the knapsack problem","display_name":"Dynamic programming algorithms for the knapsack problem","alternate_titles":[],"publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W2004942007","doi":"https://doi.org/10.1145/181983.181988","mag":"2004942007"},"language":"en","primary_location":{"id":"doi:10.1145/181983.181988","doi":"https://doi.org/10.1145/181983.181988","is_oa":true,"landing_page_url":"https://doi.org/10.1145/181983.181988","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/181983.181988","source":{"id":"https://openalex.org/S4210186172","display_name":"ACM SIGAPL APL Quote Quad","issn_l":"0163-6006","issn":["0163-6006","1558-3392"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific"],"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 SIGAPL APL Quote Quad","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2004942007"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/181983.181988","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045395418","display_name":"Moshe Sniedovich","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Moshe Sniedovich","raw_affiliation_strings":["Department of Mathematics, The University of Melbourne, Parkville, Victoria 3052 Australia","Department of Mathematics, The University of Melbourne, Parkville, Victoria 3052 Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Melbourne, Parkville, Victoria 3052 Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"Department of Mathematics, The University of Melbourne, Parkville, Victoria 3052 Australia#TAB#","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045395418"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"3","first_page":"18","last_page":"21"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9872999787330627,"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.9872999787330627,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.004100000020116568,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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":1.0},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9850000143051147},{"id":"https://openalex.org/keywords/apl-programming-language","display_name":"APL programming language","score":0.9269999861717224},{"id":"https://openalex.org/keywords/teaching-tools","display_name":"teaching aids","score":0.652999997138977},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7070000171661377}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9914108514785767},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8260780572891235},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.8221640586853027},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7375574707984924},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.637994110584259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5299020409584045},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5229716300964355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49078044295310974},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47064584493637085},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4494849145412445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3460136950016022},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2540312111377716}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/181983.181988","doi":"https://doi.org/10.1145/181983.181988","is_oa":true,"landing_page_url":"https://doi.org/10.1145/181983.181988","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/181983.181988","source":{"id":"https://openalex.org/S4210186172","display_name":"ACM SIGAPL APL Quote Quad","issn_l":"0163-6006","issn":["0163-6006","1558-3392"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific"],"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 SIGAPL APL Quote Quad","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/181983.181988","doi":"https://doi.org/10.1145/181983.181988","is_oa":true,"landing_page_url":"https://doi.org/10.1145/181983.181988","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/181983.181988","source":{"id":"https://openalex.org/S4210186172","display_name":"ACM SIGAPL APL Quote Quad","issn_l":"0163-6006","issn":["0163-6006","1558-3392"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific"],"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 SIGAPL APL Quote Quad","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004942007.pdf","grobid_xml":"https://content.openalex.org/works/W2004942007.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1500949938","https://openalex.org/W1571552128","https://openalex.org/W2011039300","https://openalex.org/W2021328726","https://openalex.org/W2072803231","https://openalex.org/W3142605167"],"related_works":["https://openalex.org/W2013555173","https://openalex.org/W2593217673","https://openalex.org/W7097491872","https://openalex.org/W2066671865","https://openalex.org/W6941191061","https://openalex.org/W4238906945","https://openalex.org/W4409687655","https://openalex.org/W638840421","https://openalex.org/W2213494789","https://openalex.org/W2361162607"],"abstract_inverted_index":{"The":[0],"knapsack":[1,41],"problem":[2],"is":[3],"one":[4],"of":[5,19],"the":[6,24],"\"classical\"":[7],"problems":[8],"in":[9],"Operations":[10],"Research.":[11],"In":[12],"this":[13],"paper":[14],"we":[15],"present":[16],"a":[17],"number":[18],"APL":[20],"codes":[21,33],"based":[22],"on":[23],"dynamic":[25],"programming":[26],"approach":[27],"to":[28,38],"such":[29],"problems.":[30],"Although":[31],"these":[32],"can":[34],"be":[35],"used":[36],"effectively":[37],"solve":[39],"small":[40],"problems,":[42],"they":[43],"were":[44],"developed":[45],"primarily":[46],"as":[47],"teaching":[48],"aids.":[49]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2004942007","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
