Pages that link to "Item:Q1755240"
From MaRDI portal
The following pages link to Integer programming models for the pre-marshalling problem (Q1755240):
Displaying 12 items.
- A local-search based heuristic for the unrestricted block relocation problem (Q2003414) (← links)
- Smart stacking for import containers using customer information at automated container terminals (Q2140194) (← links)
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules (Q2171596) (← links)
- Robust optimization for premarshalling with uncertain priority classes (Q2189929) (← links)
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem (Q2294635) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- Pre-processing a container yard under limited available time (Q2664376) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
- Novel models and algorithms for location assignment for outbound containers in container terminals (Q6112558) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)
- Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem (Q6164614) (← links)
