Pages that link to "Item:Q2631244"
From MaRDI portal
The following pages link to Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244):
Displaying 3 items.
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
