Pages that link to "Item:Q2901006"
From MaRDI portal
The following pages link to Algorithms for the constrained two-staged two-dimensional cutting problem (Q2901006):
Displaying 18 items.
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems (Q604802) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem (Q2892334) (← links)
- Algorithms for 2-Route Cut Problems (Q3521941) (← links)
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems (Q4272900) (← links)
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems (Q4679787) (← links)
- Recursive algorithm for the two‐dimensional cutting problem of punched strips (Q5190526) (← links)
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems (Q5322078) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
