{"id":"https://openalex.org/W2081751877","doi":"https://doi.org/10.1007/bf02591863","title":"Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality","display_name":"Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2081751877","doi":"https://doi.org/10.1007/bf02591863","mag":"2081751877"},"language":"en","primary_location":{"id":"doi:10.1007/bf02591863","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02591863","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5025923476","display_name":"Bezalel Gavish","orcid":null},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bezalel Gavish","raw_affiliation_strings":["Graduate School of Management, University of Rochester, 14627, Rochester, NY, USA","Graduate School of Management, University of Rochester, Rochester, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Management, University of Rochester, 14627, Rochester, NY, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"Graduate School of Management, University of Rochester, Rochester, USA","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085540118","display_name":"Hasan Pirkul","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hasan Pirkul","raw_affiliation_strings":["Academic Faculty of Accounting, Ohio State University, 43210, Columbus, OH, USA","Academic Faculty of Accounting, Ohio State University, Columbus, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academic Faculty of Accounting, Ohio State University, 43210, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Academic Faculty of Accounting, Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":19.5284,"has_fulltext":false,"cited_by_count":223,"citation_normalized_percentile":{"value":0.99486929,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"1","first_page":"78","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9922999739646912,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.982200026512146,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9752352237701416},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8187023401260376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6855489015579224},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.6305942535400391},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.628739595413208},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5985924601554871},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5854159593582153},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5729005932807922},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5284730792045593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47841912508010864},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.447824627161026},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.44691452383995056},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43798407912254333},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41995853185653687},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.35664796829223633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24597913026809692}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9752352237701416},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8187023401260376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6855489015579224},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.6305942535400391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.628739595413208},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5985924601554871},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5854159593582153},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5729005932807922},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5284730792045593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47841912508010864},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.447824627161026},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.44691452383995056},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43798407912254333},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41995853185653687},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35664796829223633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24597913026809692},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02591863","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02591863","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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":38,"referenced_works":["https://openalex.org/W54596228","https://openalex.org/W119375135","https://openalex.org/W1964171198","https://openalex.org/W1972497158","https://openalex.org/W1981134802","https://openalex.org/W2009803313","https://openalex.org/W2012682597","https://openalex.org/W2012761904","https://openalex.org/W2017127755","https://openalex.org/W2017316844","https://openalex.org/W2017515054","https://openalex.org/W2017697298","https://openalex.org/W2021328726","https://openalex.org/W2026106837","https://openalex.org/W2043513057","https://openalex.org/W2045492613","https://openalex.org/W2050216598","https://openalex.org/W2052307457","https://openalex.org/W2053301303","https://openalex.org/W2055346175","https://openalex.org/W2056380589","https://openalex.org/W2069277547","https://openalex.org/W2072803231","https://openalex.org/W2076756604","https://openalex.org/W2102428370","https://openalex.org/W2104836429","https://openalex.org/W2125893186","https://openalex.org/W2141742819","https://openalex.org/W2145068995","https://openalex.org/W2148214747","https://openalex.org/W2165012734","https://openalex.org/W2238466830","https://openalex.org/W2321605606","https://openalex.org/W2796094863","https://openalex.org/W4242130683","https://openalex.org/W4256012320","https://openalex.org/W4285719527","https://openalex.org/W6991283879"],"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/W4256002267","https://openalex.org/W2168163332","https://openalex.org/W2993365626"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":11}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}