Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760)
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 7163302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial approach to exactly solving discrete and hybrid berth allocation problem |
scientific article; zbMATH DE number 7163302 |
Statements
Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (English)
0 references
5 February 2020
0 references
combinatorial optimization
0 references
branch and bound
0 references
optimal solution
0 references
berth allocation problem
0 references
minimization of total cost
0 references
0 references
0 references
0.9104459
0 references
0.89878404
0 references
0.89493716
0 references
0 references
0.87674147
0 references
0.87528574
0 references
0 references
