Pages that link to "Item:Q2030652"
From MaRDI portal
The following pages link to An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652):
Displaying 5 items.
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
