Pages that link to "Item:Q932179"
From MaRDI portal
The following pages link to Variable neighborhood search for minimum cost berth allocation (Q932179):
Displayed 15 items.
- Tactical berth allocation under uncertainty (Q320125) (← links)
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
- Optimal policies for the berth allocation problem under stochastic nature (Q323540) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981) (← links)
- The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects (Q2030576) (← links)
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
- Selecting algorithms for large berth allocation problems (Q2294627) (← links)
- The crane scheduling problem: models and solution approaches (Q2393470) (← links)
- A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm (Q2956871) (← links)
- Metaheuristic approaches for the Berth Allocation Problem (Q4987695) (← links)
- The Dynamic Berth Allocation Problem: A linearized formulation (Q5501868) (← links)