{"id":"https://openalex.org/W2397423536","doi":"https://doi.org/10.1080/03155986.1994.11732244","title":"Exact Algorithms For The Setup Knapsack Problem","display_name":"Exact Algorithms For The Setup Knapsack Problem","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W2397423536","doi":"https://doi.org/10.1080/03155986.1994.11732244","mag":"2397423536"},"language":"en","primary_location":{"id":"doi:10.1080/03155986.1994.11732244","doi":"https://doi.org/10.1080/03155986.1994.11732244","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.1994.11732244","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"},"volume":null,"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/A5015726898","display_name":"Emmanuel D. Chajakis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1334696734","display_name":"American Airlines (United States)","ror":"https://ror.org/05jh79p16","country_code":"US","type":"company","lineage":["https://openalex.org/I1334696734"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emmanuel D. Chajakis","raw_affiliation_strings":["American Airlines Decision Technologies, PO. Box 619616, Dallas/Fort Worth Airport, TX 75261-9616, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"American Airlines Decision Technologies, PO. Box 619616, Dallas/Fort Worth Airport, TX 75261-9616, USA","institution_ids":["https://openalex.org/I1334696734"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021321550","display_name":"Monique Guignard","orcid":"https://orcid.org/0000-0003-4084-434X","observed_orcids":["https://orcid.org/0000-0003-4084-434X"]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Monique Guignard","raw_affiliation_strings":["OPIM Department, The Wharton School University of Pennsylvania, Philadelphia, PA, 19104-6366, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"OPIM Department, The Wharton School University of Pennsylvania, Philadelphia, PA, 19104-6366, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0695,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.91805485,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"32","issue":"3","first_page":"124","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9984999895095825,"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.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0005000000237487257,"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"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/exact-algorithms","display_name":"exact algorithms","score":0.7289999723434448},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9570000171661377},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.8259999752044678},{"id":"https://openalex.org/keywords/pseudo-polynomial-time","display_name":"pseudo-polynomial time","score":0.8090000152587891}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.99056077003479},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8204002976417542},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7730450630187988},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7486073970794678},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.7213120460510254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5852301120758057},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5724695324897766},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5637173652648926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5549036860466003},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5084773302078247},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.49187588691711426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45158180594444275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42996013164520264},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4160464406013489},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4158448874950409},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28404295444488525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20461446046829224},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03155986.1994.11732244","doi":"https://doi.org/10.1080/03155986.1994.11732244","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03155986.1994.11732244","pdf_url":null,"source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-b","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1965422898","https://openalex.org/W1979018429","https://openalex.org/W1993814189","https://openalex.org/W2009443800","https://openalex.org/W2011039300","https://openalex.org/W2021328726","https://openalex.org/W2045247420","https://openalex.org/W2081751877","https://openalex.org/W2082335375","https://openalex.org/W2088888085","https://openalex.org/W2127371643","https://openalex.org/W2127470768","https://openalex.org/W2138798999","https://openalex.org/W2144946856","https://openalex.org/W2155737905","https://openalex.org/W2162963178"],"related_works":["https://openalex.org/W2993365626","https://openalex.org/W2087209118","https://openalex.org/W2317501220","https://openalex.org/W4281741337","https://openalex.org/W3202092202","https://openalex.org/W4365514833","https://openalex.org/W4312871059","https://openalex.org/W780986551","https://openalex.org/W2052622832","https://openalex.org/W3085845473"],"abstract_inverted_index":{"The":[0],"Setup":[1],"Knapsack":[2],"problem":[3,85],"consists":[4],"in":[5,52,88],"selecting":[6],"items":[7,37],"from":[8],"a":[9,18,43,50,68,76],"set":[10,34],"of":[11,14,38,62,75],"disjoint":[12],"families":[13],"items,":[15],"to":[16,86],"enter":[17],"knapsack":[19,32],"while":[20],"maximizing":[21],"its":[22,39],"value.":[23],"An":[24],"item":[25,63],"can":[26],"be":[27],"selected":[28],"only":[29],"if":[30],"the":[31,97],"is":[33,91],"up":[35],"for":[36],"family.":[40],"We":[41,66,95],"give":[42],"0-1":[44],"programming":[45],"formulation":[46],"and":[47,72],"we":[48],"propose":[49],"reformulation":[51],"which":[53],"setup":[54],"variables":[55],"are":[56],"replaced":[57],"by":[58],"equivalent":[59],"Boolean":[60],"unions":[61],"assignment":[64],"variables.":[65],"present":[67],"Dynamic":[69],"Programming":[70],"algorithm":[71],"two":[73],"versions":[74],"two-phase":[77],"enunierative":[78],"scheme.":[79],"These":[80],"algorithms":[81,98],"solve":[82],"this":[83],"NP-hard":[84],"optimality":[87],"time":[89],"that":[90],"at":[92],"worst":[93],"pseudo-polynomial.":[94],"test":[96,102],"on":[99],"randomly":[100],"generated":[101],"problems":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}