A fast algorithm for knapsack problem with conflict graph (Q5024916)
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 7467536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for knapsack problem with conflict graph |
scientific article; zbMATH DE number 7467536 |
Statements
A Fast Algorithm for Knapsack Problem with Conflict Graph (English)
0 references
1 February 2022
0 references
combinatorial optimization
0 references
branch-and-bound
0 references
knapsack problem with conflict graph
0 references
maximum weight stable set problem
0 references
0 references
0 references
0.9150651693344116
0 references
0.8583098649978638
0 references
0.8435894250869751
0 references
0.8154972791671753
0 references
0.8015106916427612
0 references
