A new upper bound for the multiple knapsack problem (Q2668625)
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 upper bound for the multiple knapsack problem |
scientific article; zbMATH DE number 7485238
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for the multiple knapsack problem |
scientific article; zbMATH DE number 7485238 |
Statements
A new upper bound for the multiple knapsack problem (English)
0 references
7 March 2022
0 references
multiple knapsack problem
0 references
sequential relaxation
0 references
upper bound
0 references
divisible sizes
0 references
0 references
