Cover by disjoint cliques cuts for the knapsack problem with conflicting items
From MaRDI portal
Publication:2670441
DOI10.1016/j.orl.2021.10.001OpenAlexW3205712728MaRDI QIDQ2670441
Eduardo Uchoa, Haroldo Gambini Santos, Thiago Alcântara Luiz
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.10.001
Related Items (2)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ The knapsack problem with forfeit sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Wheel inequalities for stable set polytopes
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Optimization algorithms for the disjunctively constrained knapsack problem
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Finding a Maximum Independent Set
- Facets of the Knapsack Polytope From Minimal Covers
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- On the facial structure of set packing polyhedra
This page was built for publication: Cover by disjoint cliques cuts for the knapsack problem with conflicting items
