Pages that link to "Item:Q1751771"
From MaRDI portal
The following pages link to An algorithm with performance guarantee for the online container relocation problem (Q1751771):
Displaying 12 items.
- The bounded beam search algorithm for the block relocation problem (Q1634080) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Online and offline container purchasing and repositioning problem (Q1680051) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- An average-case asymptotic analysis of the container relocation problem (Q1709944) (← links)
- An efficient ant colony optimization algorithm for the blocks relocation problem (Q1755234) (← links)
- New integer programming models for slab stack shuffling problems (Q2109751) (← links)
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules (Q2171596) (← links)
- On-line scheduling of empty containers (Q2920363) (← links)
- Optimizing the number of deployed yard cranes in a container terminal (Q5883816) (← links)
- Approximate dynamic programming for container stacking (Q6113333) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)