A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BBMCL / rank | |||
Normal rank | |||
Revision as of 13:11, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts |
scientific article |
Statements
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (English)
0 references
3 June 2021
0 references
combinatorial optimization
0 references
knapsack problem with conflicts
0 references
maximum weighted clique problem
0 references
branch-and-bound algorithm
0 references
