Pages that link to "Item:Q1825765"
From MaRDI portal
The following pages link to The cutting stock problem in the canvas industry (Q1825765):
Displayed 9 items.
- Limiting the number of each piece in two-dimensional cutting stock patterns (Q1197090) (← links)
- An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- Heuristic methods for gang-rip saw arbor design. (Q1420446) (← links)
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- A column generation procedure for gang-rip saw arbor design and scheduling (Q4230062) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)