A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts |
scientific article; zbMATH DE number 7354330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts |
scientific article; zbMATH DE number 7354330 |
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
0 references
0 references
0 references
0 references
