Pages that link to "Item:Q2424775"
From MaRDI portal
The following pages link to Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775):
Displaying 15 items.
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← 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 and flexible berth allocation model with stochastic vessel arrival times (Q2005875) (← links)
- New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
- A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals (Q2163853) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- Pilotage planning in seaports (Q2189919) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← 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)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
- Proactive berth scheduling with data-driven buffer time in container terminals (Q6495372) (← links)
