Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182)
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: Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations |
scientific article; zbMATH DE number 6650731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations |
scientific article; zbMATH DE number 6650731 |
Statements
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (English)
0 references
10 November 2016
0 references
combinatorial optimization
0 references
crane scheduling
0 references
container stacking
0 references
mixed integer program
0 references
stacker crane problem
0 references
0 references
0 references
0 references
0 references
0 references
0.7985826730728149
0 references
0.7904701232910156
0 references
0.7845445275306702
0 references
0.7795218229293823
0 references
0.7707945704460144
0 references
