Pages that link to "Item:Q1774168"
From MaRDI portal
The following pages link to The two-dimensional cutting stock problem revisited (Q1774168):
Displaying 22 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- An approximation algorithm for the cutting-sticks problem (Q477614) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
- A note on the approximability of cutting stock problems (Q2643962) (← links)
- A near-optimal solution to a two-dimensional cutting stock problem (Q2757657) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem (Q3114706) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- (Q3705224) (← links)
- An approach to two-dimensional cutting stock problems (Q3753794) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- (Q6167198) (← links)
