Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438)
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: Heuristic approaches for the two- and three-dimensional knapsack packing problem |
scientific article; zbMATH DE number 5377404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic approaches for the two- and three-dimensional knapsack packing problem |
scientific article; zbMATH DE number 5377404 |
Statements
Heuristic approaches for the two- and three-dimensional knapsack packing problem (English)
0 references
4 December 2008
0 references
cutting and packing
0 references
two-dimensional knapsack problems
0 references
three-dimensional knapsack problem
0 references
heuristics
0 references
simulated annealing
0 references
sequence pair
0 references
sequence-tripple
0 references
0 references
0 references
0 references
0.8455363512039185
0 references
0.821713924407959
0 references
0.8055746555328369
0 references
0.8010054230690002
0 references
0.8007007241249084
0 references
