Pages that link to "Item:Q724053"
From MaRDI portal
The following pages link to A new effective unified model for solving the pre-marshalling and block relocation problems (Q724053):
Displaying 15 items.
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- A local-search based heuristic for the unrestricted block relocation problem (Q2003414) (← links)
- A branch-and-cut algorithm for the restricted block relocation problem (Q2023911) (← 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)
- The block relocation problem with appointment scheduling (Q2242274) (← links)
- An exact approach to the restricted block relocation problem based on a new integer programming formulation (Q2242296) (← links)
- An exact algorithm for the block relocation problem with a stowage plan (Q2315632) (← 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)
- 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)
- A new modeling approach for the unrestricted block relocation problem (Q6201533) (← links)