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 7 items.
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
- A new dynamic programming procedure for three-staged cutting patterns (Q1941034) (← links)
- 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)
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem (Q3114706) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)