{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:33:41Z","timestamp":1759667621791,"version":"3.44.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1016\/j.orl.2021.10.001","type":"journal-article","created":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T10:32:02Z","timestamp":1634207522000},"page":"844-850","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cover by disjoint cliques cuts for the knapsack problem with conflicting items"],"prefix":"10.1016","volume":"49","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3329-0994","authenticated-orcid":false,"given":"Thiago Alc\u00e2ntara","family":"Luiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haroldo Gambini","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2021.10.001_br0260","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.disopt.2016.05.005","article-title":"Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph","volume":"21","author":"Agra","year":"2016","journal-title":"Discrete Optim."},{"key":"10.1016\/j.orl.2021.10.001_br0250","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.cor.2019.104782","article-title":"Strong bounds for resource constrained project scheduling: preprocessing and cutting planes","volume":"113","author":"Araujo","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.orl.2021.10.001_br0070","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2021.10.001_br0150","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","article-title":"Facets of the knapsack polytope from minimal covers","volume":"34","author":"Balas","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.orl.2021.10.001_br0240","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/j.cor.2009.12.008","article-title":"A strengthened formulation and cutting planes for the open pit mine production scheduling problem","volume":"37","author":"Bley","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.orl.2021.10.001_br0210","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.orl.2016.01.011","article-title":"A polyhedral study on 0\u20131 knapsack problems with set packing constraints","volume":"44","author":"Ca\u00f1avate","year":"2016","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.orl.2021.10.001_br0060","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02614623","article-title":"Wheel inequalities for stable set polytopes","volume":"77","author":"Cheng","year":"1997","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2021.10.001_br0120","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.ejor.2020.07.023","article-title":"A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts","volume":"289","author":"Coniglio","year":"2021","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.orl.2021.10.001_br0170","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","article-title":"Lifted cover inequalities for 0\u20131 integer programs: computation","volume":"10","author":"Gu","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2021.10.001_br0130","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","article-title":"Solving airline crew scheduling problems by branch-and-cut","volume":"39","author":"Hoffman","year":"1993","journal-title":"Manag. Sci."},{"key":"10.1016\/j.orl.2021.10.001_br0200","first-page":"1","article-title":"Knapsack polytopes: a survey","author":"Hojny","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.orl.2021.10.001_br0020","series-title":"Multiple Knapsack Problems","first-page":"285","article-title":"Knapsack problems","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.orl.2021.10.001_br0090","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.orl.2018.12.005","article-title":"On lifted cover inequalities: a new lifting procedure with unusual properties","volume":"47","author":"Letchford","year":"2019","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2021.10.001_br0040","series-title":"Integer Programming: Theory and Practice","first-page":"144","article-title":"Noncommercial software for mixed-integer linear programming","volume":"vol. 3","author":"Linderoth","year":"2005"},{"year":"1990","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","key":"10.1016\/j.orl.2021.10.001_br0010"},{"issue":"5","key":"10.1016\/j.orl.2021.10.001_br0190","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6377(94)90038-8","article-title":"Lifted cover facets of the 0\u20131 knapsack polytope with GUB constraints","volume":"16","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.orl.2021.10.001_br0050","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2021.10.001_br0160","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(95)00113-6","article-title":"Lifting cover inequalities for the precedence-constrained knapsack problem","volume":"72","author":"Park","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2021.10.001_br0140","series-title":"Encyclopedia of Optimization","first-page":"3676","article-title":"Stable set problem: branch & cut algorithms","author":"Rebennack","year":"2009"},{"key":"10.1016\/j.orl.2021.10.001_br0110","first-page":"193","article-title":"Bin packing with conflicts: a generic branch-and-price algorithm","volume":"25","author":"Sadykov","year":"2012","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2021.10.001_br0180","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1007\/s00500-016-2465-7","article-title":"Optimization algorithms for the disjunctively constrained knapsack problem","volume":"22","author":"Salem","year":"2018","journal-title":"Soft Comput."},{"author":"Santos","key":"10.1016\/j.orl.2021.10.001_br0270"},{"issue":"3","key":"10.1016\/j.orl.2021.10.001_br0030","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","article-title":"Finding a maximum independent set","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2021.10.001_br0080","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces for a linear inequality in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Math. Program."},{"issue":"9","key":"10.1016\/j.orl.2021.10.001_br0100","first-page":"2864","article-title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","volume":"43","author":"Yamada","year":"2002","journal-title":"J\u014dh\u014d Shori Gakkai Rombunshi"},{"issue":"2","key":"10.1016\/j.orl.2021.10.001_br0220","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.disopt.2010.09.004","article-title":"A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting","volume":"8","author":"Zeng","year":"2011","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.orl.2021.10.001_br0230","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.disopt.2010.09.005","article-title":"A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting","volume":"8","author":"Zeng","year":"2011","journal-title":"Discrete Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721001474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721001474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:36:35Z","timestamp":1759098995000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637721001474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["S0167637721001474"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.10.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[2021,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cover by disjoint cliques cuts for the knapsack problem with conflicting items","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.10.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}