Pages that link to "Item:Q5501868"
From MaRDI portal
The following pages link to The Dynamic Berth Allocation Problem: A linearized formulation (Q5501868):
Displaying 10 items.
- 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)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- Mathematical models for the berth allocation problem in dry bulk terminals (Q1707825) (← 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)
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results (Q2341106) (← links)
- On the berth allocation problem (Q2826660) (← links)
- An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study (Q2969974) (← links)
- An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model (Q6065602) (← links)
