A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2620796999 / rank | |||
Normal rank | |||
Revision as of 21:17, 19 March 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
