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):
Displaying 26 items.
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem (Q316266) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems (Q604802) (← 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)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← 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)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← 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)
- Algorithms for the constrained two-staged two-dimensional cutting problem (Q2901006) (← links)
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems (Q3157808) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem (Q3468863) (← links)
- An approach to two-dimensional cutting stock problems (Q3753794) (← links)
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems (Q4272900) (← links)
- (Q4319397) (← links)
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm (Q4367021) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS (Q5291406) (← links)
- (Q6167198) (← links)
