A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:33, 7 February 2024
scientific article; zbMATH DE number 6821364
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
