An exact constructive algorithm for the knapsack sharing problem (Q4594846)
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: An exact constructive algorithm for the knapsack sharing problem |
scientific article; zbMATH DE number 6812873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact constructive algorithm for the knapsack sharing problem |
scientific article; zbMATH DE number 6812873 |
Statements
An exact constructive algorithm for the knapsack sharing problem (English)
0 references
24 November 2017
0 references
branch and bound
0 references
combinatorial optimization
0 references
knapsack sharing
0 references
heuristics
0 references
interval reduction
0 references
optimization
0 references
0.8847447037696838
0 references
0.8795719146728516
0 references
0.8703470826148987
0 references
0.8687053918838501
0 references
0.8659690022468567
0 references
