Pages that link to "Item:Q6056889"
From MaRDI portal
The following pages link to An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889):
Displaying 9 items.
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- (Q4219274) (← links)
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196) (← links)
- A new upper bound for unconstrained two-dimensional cutting and packing (Q4656659) (← links)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting (Q6568431) (← links)