Pages that link to "Item:Q933804"
From MaRDI portal
The following pages link to T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804):
Displaying 8 items.
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← 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)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem (Q3514843) (← links)