New upper bounds and exact methods for the knapsack sharing problem (Q2396494)
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: New upper bounds and exact methods for the knapsack sharing problem |
scientific article; zbMATH DE number 6727123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds and exact methods for the knapsack sharing problem |
scientific article; zbMATH DE number 6727123 |
Statements
New upper bounds and exact methods for the knapsack sharing problem (English)
0 references
8 June 2017
0 references
combinatorial optimization
0 references
decomposition
0 references
discrete optimization
0 references
knapsack
0 references
optimality
0 references
sharing
0 references
upper bound
0 references
0 references
0.8722457885742188
0 references
0.8659690022468567
0 references
0.8540094494819641
0 references
0.8528074622154236
0 references
0.8481371998786926
0 references
