Pages that link to "Item:Q2967574"
From MaRDI portal
The following pages link to An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574):
Displayed 4 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)