Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cover by disjoint cliques cuts for the knapsack problem with conflicting items |
scientific article |
Statements
Cover by disjoint cliques cuts for the knapsack problem with conflicting items (English)
0 references
11 March 2022
0 references
cover inequality
0 references
lifting
0 references
knapsack problem
0 references
combinatorial cuts
0 references
clique inequality
0 references
0 references
0 references
0 references
