{"id":"https://openalex.org/W2536484881","doi":"https://doi.org/10.1109/codit.2016.7593623","title":"Polyhedral analysis for the disjunctively constrained Knapsack Problem","display_name":"Polyhedral analysis for the disjunctively constrained Knapsack Problem","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2536484881","doi":"https://doi.org/10.1109/codit.2016.7593623","mag":"2536484881"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2016.7593623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5110757530","display_name":"M. Ben Salem","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Mariem Ben Salem","raw_affiliation_strings":["FSEGS/MIRACL, Universit\u00e9 de Sfax, Tunisia"],"affiliations":[{"raw_affiliation_string":"FSEGS/MIRACL, Universit\u00e9 de Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054801518","display_name":"Raouia Taktak","orcid":"https://orcid.org/0000-0003-2377-5709"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Raouia Taktak","raw_affiliation_strings":["ISISIMS, Universit\u00e9 de Sfax, Tunisia"],"affiliations":[{"raw_affiliation_string":"ISISIMS, Universit\u00e9 de Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071197622","display_name":"Han\u00eane Ben\u2010Abdallah","orcid":"https://orcid.org/0000-0001-9215-4661"},"institutions":[{"id":"https://openalex.org/I185163786","display_name":"King Abdulaziz University","ror":"https://ror.org/02ma4wv74","country_code":"SA","type":"education","lineage":["https://openalex.org/I185163786"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Hanene Ben Abdallah","raw_affiliation_strings":["King Abdulaziz University, Jeddah, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"King Abdulaziz University, Jeddah, Saudi Arabia","institution_ids":["https://openalex.org/I185163786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["LAMSADE, Universite Paris-Dauphine, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universite Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110757530"],"corresponding_institution_ids":["https://openalex.org/I142899784"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15072431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"557","last_page":"562"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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.996399998664856,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9950000047683716,"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.9931246042251587},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8483951091766357},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7507508993148804},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5856807231903076},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5220943689346313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5194834470748901},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.516319215297699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.51095050573349},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4514707922935486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42711782455444336},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3886339068412781},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.34427809715270996}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9931246042251587},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8483951091766357},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7507508993148804},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5856807231903076},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5220943689346313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5194834470748901},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.516319215297699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.51095050573349},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4514707922935486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42711782455444336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3886339068412781},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34427809715270996},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2016.7593623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1578651618","https://openalex.org/W1967535666","https://openalex.org/W1991247020","https://openalex.org/W2000043213","https://openalex.org/W2000840218","https://openalex.org/W2004084436","https://openalex.org/W2011039300","https://openalex.org/W2014354724","https://openalex.org/W2041021599","https://openalex.org/W2064366623","https://openalex.org/W2066554880","https://openalex.org/W2066671865","https://openalex.org/W2066705079","https://openalex.org/W2075339720","https://openalex.org/W2084894096","https://openalex.org/W2089402478","https://openalex.org/W2100440346","https://openalex.org/W2101980173","https://openalex.org/W2117522563","https://openalex.org/W2124452917","https://openalex.org/W2140043891","https://openalex.org/W2167539320","https://openalex.org/W2555367514","https://openalex.org/W3134267570","https://openalex.org/W4243344927","https://openalex.org/W4300645277","https://openalex.org/W6672997692"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W4249611560","https://openalex.org/W2889442766","https://openalex.org/W1483913682","https://openalex.org/W2048876360","https://openalex.org/W2412614002","https://openalex.org/W2993365626","https://openalex.org/W2020081923","https://openalex.org/W1969981152","https://openalex.org/W2087209118"],"abstract_inverted_index":{"The":[0,18],"paper":[1],"deals":[2],"with":[3,7,53],"the":[4,12,28,38,47,50,58,80],"Knapsack":[5,15],"Problem":[6,16],"conflicts,":[8],"also":[9,97],"known":[10],"as":[11],"Disjunctively":[13],"Constrained":[14],"(DCKP).":[17],"conflicts":[19],"are":[20,27,96],"represented":[21],"by":[22],"a":[23,43,85,91],"graph":[24],"whose":[25],"vertices":[26],"items":[29,33],"such":[30],"that":[31],"adjacent":[32],"cannot":[34],"be":[35],"packed":[36],"in":[37],"knapsack":[39],"simultaneously.":[40],"We":[41,65],"consider":[42],"classical":[44],"formulation":[45,55],"for":[46],"DCKP,":[48],"study":[49],"polytope":[51],"associated":[52],"this":[54,73],"and":[56,83],"investigate":[57],"facial":[59],"aspect":[60],"of":[61,79,93],"its":[62],"basic":[63],"constraints.":[64],"then":[66],"present":[67],"some":[68],"valid":[69,81],"inequalities.":[70],"Based":[71],"on":[72,90],"study,":[74],"we":[75],"discuss":[76],"separation":[77],"routines":[78],"inequalities":[82],"devise":[84],"Branch-and-Cut":[86],"algorithm.":[87],"Preliminary":[88],"results":[89],"set":[92],"problem":[94],"instances":[95],"given.":[98]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}