An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7636603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem |
scientific article; zbMATH DE number 7636603 |
Statements
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (English)
0 references
23 December 2022
0 references
optimization
0 references
heuristic
0 references
iterated local search
0 references
two-dimensional knapsack packing
0 references
0 references
0 references
0 references
0 references
0 references
0.8119202852249146
0 references
0.8111742734909058
0 references
0.8006625771522522
0 references
0.7991730570793152
0 references
