{"id":"https://openalex.org/W3123557109","doi":"https://doi.org/10.1007/s10107-003-0420-8","title":"A polyhedral study of the cardinality constrained knapsack problem","display_name":"A polyhedral study of the cardinality constrained knapsack problem","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W3123557109","doi":"https://doi.org/10.1007/s10107-003-0420-8","mag":"3123557109"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.9998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2001/10/380.pdf","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/4246","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111737493","display_name":"Ismael R. de Farias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ismael R. de Farias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064083047","display_name":"Georges L. Nemhauser","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georges L. Nemhauser","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.61606426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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.9986000061035156,"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.9919000267982483,"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/T12288","display_name":"Optimization and Search Problems","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8638530373573303},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.717433512210846},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6900342702865601},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6721419095993042},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6413997411727905},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5710626840591431},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5340952277183533},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46540743112564087},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4452032744884491},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.43706125020980835},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.42438358068466187},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4160791337490082},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.41201579570770264},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40350717306137085},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3656988739967346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3548257350921631},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22704145312309265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16108930110931396}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8638530373573303},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.717433512210846},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6900342702865601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6721419095993042},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6413997411727905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5710626840591431},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5340952277183533},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46540743112564087},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4452032744884491},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.43706125020980835},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.42438358068466187},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4160791337490082},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.41201579570770264},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40350717306137085},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3656988739967346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3548257350921631},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22704145312309265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16108930110931396},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.9998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2001/10/380.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.559.7487","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.559.7487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mat.uc.pt/~jsoares/eventos/diadeoc/paper4.pdf","raw_type":"text"},{"id":"mag:3123557109","is_oa":false,"landing_page_url":"https://econpapers.repec.org/paper/corlouvco/2002002.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RePEc: Research Papers in Economics","raw_type":null},{"id":"pmh:oai:RePEc:cor:louvco:2002002","is_oa":false,"landing_page_url":"https://sites.uclouvain.be/core/publications/coredp/coredp2002.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"preprint"},{"id":"pmh:oai:RePEc:cor:louvrp:1634","is_oa":false,"landing_page_url":"http://doi.org/10.1007/s10107-003-0420-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"preprint"},{"id":"pmh:oai:dial.uclouvain.be:boreal:4246","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/4246","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingPaper"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:4246","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/4246","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2910445340","https://openalex.org/W2011130308","https://openalex.org/W70274885","https://openalex.org/W1973223260","https://openalex.org/W1974903013","https://openalex.org/W2036861438","https://openalex.org/W2064267171","https://openalex.org/W2013296632","https://openalex.org/W3201674126","https://openalex.org/W2952780795","https://openalex.org/W3171193307","https://openalex.org/W3135351174","https://openalex.org/W53144308","https://openalex.org/W3118654993","https://openalex.org/W257079062","https://openalex.org/W2112825959","https://openalex.org/W2567449761","https://openalex.org/W1973479963","https://openalex.org/W2030982114","https://openalex.org/W2053148226"],"abstract_inverted_index":{"A":[0],"cardinality":[1,39,79],"constrained":[2],"knapsack":[3,8],"problem":[4,9],"is":[5],"a":[6,15,82],"continuous":[7,54,73,106],"in":[10,31,64,68,101,124],"which":[11,65],"no":[12],"more":[13],"than":[14],"specified":[16],"number":[17],"of":[18,89,97,104,117,130,149,167,174,177,191],"nonnegative":[19],"variables":[20,47,182],"are":[21,41,154],"allowed":[22],"to":[23,127,141],"be":[24,139],"positive.":[25],"This":[26],"structure":[27],"occurs,":[28],"for":[29,93,188],"example,":[30],"areas":[32],"as":[33],"finance,":[34],"location,":[35],"and":[36,48,55,75,86,119,132,171],"scheduling.":[37],"Traditionally,":[38],"constraints":[40,50],"modeled":[42],"by":[43],"introducing":[44,179],"auxiliary":[45,180],"0-1":[46,57,125,181],"additional":[49],"that":[51,153,163],"relate":[52],"the":[53,56,69,72,78,87,94,98,102,105,110,115,165,172,175,184],"variables.":[58,107],"We":[59,145],"use":[60,88],"an":[61],"alternative":[62],"approach,":[63],"we":[66,76,113,133,159],"keep":[67],"model":[70],"only":[71],"variables,":[74],"enforce":[77],"constraint":[80],"through":[81],"specialized":[83],"branching":[84],"scheme":[85],"strong":[90],"inequalities":[91,137,152,170],"valid":[92,111],"convex":[95],"hull":[96],"feasible":[99],"set":[100],"space":[103],"To":[108],"derive":[109,142],"inequalities,":[112],"extend":[114],"concepts":[116],"cover":[118,120,136,156,169],"inequality,":[121],"commonly":[122],"used":[123],"programming,":[126],"this":[128,189],"class":[129,190],"problems,":[131],"show":[134],"how":[135],"can":[138],"lifted":[140,155,168],"facet-defining":[143,151],"inequalities.":[144,157],"present":[146],"three":[147],"families":[148],"non-trivial":[150],"Finally,":[158],"report":[160],"computational":[161],"results":[162],"demonstrate":[164],"effectiveness":[166],"superiority":[173],"approach":[176,187],"not":[178],"over":[183],"traditional":[185],"MIP":[186],"problems.":[192]},"counts_by_year":[],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}