Pages that link to "Item:Q2384599"
From MaRDI portal
The following pages link to Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns (Q2384599):
Displaying 14 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← 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 integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem (Q2654397) (← links)
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns (Q2811482) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)