Pages that link to "Item:Q1634080"
From MaRDI portal
The following pages link to The bounded beam search algorithm for the block relocation problem (Q1634080):
Displaying 9 items.
- 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)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← 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)
- A note on ``An exact algorithm for the blocks relocation problem with new lower bounds'' (Q2664422) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
- A new modeling approach for the unrestricted block relocation problem (Q6201533) (← links)
