Pages that link to "Item:Q2767721"
From MaRDI portal
The following pages link to Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem (Q2767721):
Displayed 10 items.
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem (Q316266) (← links)
- 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)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS (Q5291406) (← links)