Pages that link to "Item:Q1278579"
From MaRDI portal
The following pages link to The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579):
Displaying 15 items.
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
