Pages that link to "Item:Q2490166"
From MaRDI portal
The following pages link to Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166):
Displaying 9 items.
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns (Q2356096) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
