Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58826413, #quickstatements; #temporary_batch_1710702420720 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.12.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058038705 / rank | |||
Normal rank | |||
Revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic approaches for the two- and three-dimensional knapsack packing problem |
scientific article |
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
