A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315)
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 6821364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph |
scientific article; zbMATH DE number 6821364 |
Statements
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (English)
0 references
29 December 2017
0 references
knapsack problem
0 references
maximum weight stable set problem
0 references
branch and bound
0 references
combinatorial optimization
0 references
computational experiments
0 references
0 references
0 references
0.95814955
0 references
0 references
0.93492097
0 references
0.91711515
0 references
0.9097815
0 references
0.90852255
0 references
0.9078826
0 references
0.90529114
0 references
