Pages that link to "Item:Q2921464"
From MaRDI portal
The following pages link to A Branch and Price Procedure for the Container Premarshalling Problem (Q2921464):
Displaying 12 items.
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- A new effective unified model for solving the pre-marshalling and block relocation problems (Q724053) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- A feasibility-based heuristic for the container pre-marshalling problem (Q1752173) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- An exact algorithm for the block relocation problem with a stowage plan (Q2315632) (← links)
- Deep learning assisted heuristic tree search for the container pre-marshalling problem (Q2333140) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
- Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem (Q6164614) (← links)