Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7487741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cover by disjoint cliques cuts for the knapsack problem with conflicting items |
scientific article; zbMATH DE number 7487741 |
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
0.8250454068183899
0 references
0.7840888500213623
0 references
0.7777217626571655
0 references
0.7752349972724915
0 references
