Pages that link to "Item:Q339642"
From MaRDI portal
The following pages link to Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642):
Displaying 8 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem (Q3514843) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)