The berth allocation problem with a cut-and-run option
From MaRDI portal
Recommendations
- The berth allocation problem: models and solution methods
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- On the berth allocation problem
- Berth allocation planning optimization in container terminals
Cited in
(14)- A survey of berth allocation and quay crane scheduling problems in container terminals
- The berth allocation problem: models and solution methods
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
- Selecting algorithms for large berth allocation problems
- A note on ``Tactical berth allocation under uncertainty
- Berth assignment for liner carrier clusters under a cooperative environment
- POPMUSIC as a matheuristic for the berth allocation problem
- On the berth allocation problem
- The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
- New lower bound and exact method for the continuous berth allocation problem
- Metaheuristic approaches for the berth allocation problem
- Combinatorial relaxation bounds and preprocessing for berth allocation problems
- A fuzzy optimization model for the berth allocation problem
This page was built for publication: The berth allocation problem with a cut-and-run option
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392046)