A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356)
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: A dynamic programming-based matheuristic for the dynamic berth allocation problem |
scientific article; zbMATH DE number 7198376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming-based matheuristic for the dynamic berth allocation problem |
scientific article; zbMATH DE number 7198376 |
Statements
A dynamic programming-based matheuristic for the dynamic berth allocation problem (English)
0 references
11 May 2020
0 references
dynamic Berth allocation problem
0 references
matheuristic
0 references
dynasearch
0 references
Lagrangian decomposition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93948257
0 references
0 references
0.91610646
0 references
0.89641565
0 references
0 references
0.89323616
0 references
