Pages that link to "Item:Q4656659"
From MaRDI portal
The following pages link to A new upper bound for unconstrained two-dimensional cutting and packing (Q4656659):
Displayed 9 items.
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- The geometry of nesting problems: a tutorial (Q2384608) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← 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)