Pages that link to "Item:Q930939"
From MaRDI portal
The following pages link to Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939):
Displaying 15 items.
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- New lower bounds for bin packing problems with conflicts (Q976310) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (Q2830956) (← links)
