{"id":"https://openalex.org/W1974632181","doi":"https://doi.org/10.1016/s0305-0548(03)00021-2","title":"A branch &amp; bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints","display_name":"A branch &amp; bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints","publication_year":2003,"publication_date":"2003-03-04","ids":{"openalex":"https://openalex.org/W1974632181","doi":"https://doi.org/10.1016/s0305-0548(03)00021-2","mag":"1974632181"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(03)00021-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00021-2","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers &amp; Operations Research","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/A5028890725","display_name":"George Kozanidis","orcid":"https://orcid.org/0000-0002-4325-2975"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Kozanidis","raw_affiliation_strings":["Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA 02115 5000, USA","Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA 02115 5000, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA#TAB#","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085925449","display_name":"Emanuel Melachrinoudis","orcid":"https://orcid.org/0000-0002-1929-0963"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Emanuel Melachrinoudis","raw_affiliation_strings":["Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA 02115 5000, USA","Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA 02115 5000, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Department of Mechanical, Industrial and Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center Boston, MA#TAB#","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085925449"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":3.095,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90340262,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"5","first_page":"695","last_page":"711"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9959999918937683,"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.9959999918937683,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.9896000027656555,"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.9694358110427856},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.692289412021637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6773966550827026},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6251708269119263},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.618057370185852},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5760887861251831},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5613467693328857},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5567003488540649},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5549936294555664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5006823539733887},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4932202696800232},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4448379576206207},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4249187707901001},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4144340455532074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3827759623527527},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.25899332761764526}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9694358110427856},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.692289412021637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6773966550827026},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6251708269119263},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.618057370185852},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5760887861251831},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5613467693328857},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5567003488540649},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5549936294555664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5006823539733887},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4932202696800232},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4448379576206207},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4249187707901001},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4144340455532074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3827759623527527},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25899332761764526},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(03)00021-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00021-2","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers &amp; Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W112978176","https://openalex.org/W133618948","https://openalex.org/W1965268014","https://openalex.org/W1966257397","https://openalex.org/W1979018429","https://openalex.org/W1993814189","https://openalex.org/W2001472819","https://openalex.org/W2024427769","https://openalex.org/W2025299767","https://openalex.org/W2086168649","https://openalex.org/W2119039305","https://openalex.org/W2127470768","https://openalex.org/W2135814502","https://openalex.org/W2155737905","https://openalex.org/W2157513965","https://openalex.org/W2395527326","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4301216918","https://openalex.org/W6711967923"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W4249611560","https://openalex.org/W2889442766","https://openalex.org/W1483913682","https://openalex.org/W1538797328","https://openalex.org/W2048876360","https://openalex.org/W2066850897","https://openalex.org/W2042215625","https://openalex.org/W2020030076","https://openalex.org/W2045247420"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
