Pages that link to "Item:Q2023911"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the restricted block relocation problem (Q2023911):
Displaying 10 items.
- New integer programming models for slab stack shuffling problems (Q2109751) (← 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)
- 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 efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes (Q2669644) (← 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)
