{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:17:29Z","timestamp":1729660649116,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/codit.2016.7593623","type":"proceedings-article","created":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T17:03:46Z","timestamp":1476983026000},"page":"557-562","source":"Crossref","is-referenced-by-count":0,"title":["Polyhedral analysis for the disjunctively constrained Knapsack Problem"],"prefix":"10.1109","author":[{"given":"Mariem","family":"Ben Salem","sequence":"first","affiliation":[]},{"given":"Raouia","family":"Taktak","sequence":"additional","affiliation":[]},{"given":"Hanene","family":"Ben Abdallah","sequence":"additional","affiliation":[]},{"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIE.2009.5223682"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2014.173"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CCCA.2011.6031544"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2015.1068969"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0359-5"},{"key":"ref15","first-page":"35","article-title":"The complexity of cover inequality separation","volume":"23","author":"diego","year":"1998","journal-title":"Operations Resarch"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118600245.ch10"},{"key":"ref17","article-title":"Dynamic program-ming and tight bounds for the 0-1 knapsack problem","author":"martello","year":"1997","journal-title":"Datalogisk Institut KØbenhavns Universitet"},{"journal-title":"Knapsack Problems Algorithms and Computer Implementations","year":"1990","author":"martello","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.71"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"harlan","year":"1983","journal-title":"Operations Research"},{"key":"ref27","article-title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","volume":"43","author":"yamada","year":"2002","journal-title":"Information Processing Society of Japan Journal"},{"article-title":"Bounds and algorithms for the knapsack problem with conflict graph","year":"2014","author":"bettinelli","key":"ref3"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness 1979","year":"1979","author":"michael","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00124-4"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","article-title":"Facet of regular 0-1 polytopes","volume":"8","author":"peter","year":"1975","journal-title":"Mathematical Programming"},{"key":"ref7","volume":"2","author":"gr\u00f6tschel","year":"2012","journal-title":"Geometric Algorithms and Combinatorial Optimization"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580440"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.10.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.01.019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580222"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.4.570"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00186"},{"key":"ref24","article-title":"Reduction and exact algorithms for the disjunctively constrained knapsack problem","author":"senisuka","year":"2005","journal-title":"International Symposium Operational Research Bremen"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0499"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580441"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614517"}],"event":{"name":"2016 International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2016,4,6]]},"location":"Saint Julian's, Malta","end":{"date-parts":[[2016,4,8]]}},"container-title":["2016 International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7587666\/7593519\/07593623.pdf?arnumber=7593623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:44:05Z","timestamp":1498340645000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7593623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/codit.2016.7593623","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}