Pages that link to "Item:Q1662642"
From MaRDI portal
The following pages link to Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642):
Displayed 8 items.
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)