The following pages link to On the berth allocation problem (Q2826660):
Displaying 13 items.
- Tactical berth allocation under uncertainty (Q320125) (← links)
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
- The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions (Q398926) (← links)
- Combinatorial relaxation bounds and preprocessing for berth allocation problems (Q510943) (← links)
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
- Berth allocation at indented berths for mega-containerships (Q858478) (← links)
- The berth allocation problem: models and solution methods (Q1424376) (← links)
- The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
- Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
- Berth assignment for liner carrier clusters under a cooperative environment (Q2669590) (← links)
- An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study (Q2969974) (← links)
