A new upper bound for the multiple knapsack problem (Q6350846)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound for the multiple knapsack problem |
scientific article |
Statements
8 October 2020
0 references
math.OC
0 references
