Pages that link to "Item:Q5392046"
From MaRDI portal
The following pages link to The Berth Allocation Problem with a Cut-and-Run Option (Q5392046):
Displaying 5 items.
- Combinatorial relaxation bounds and preprocessing for berth allocation problems (Q510943) (← links)
- A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981) (← links)
- Optimal berth allocation and time-invariant quay crane assignment in container terminals (Q2256246) (← links)
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
- On the berth allocation problem (Q2826660) (← links)