Pages that link to "Item:Q2643962"
From MaRDI portal
The following pages link to A note on the approximability of cutting stock problems (Q2643962):
Displaying 3 items.
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths (Q2884299) (← links)
