Pages that link to "Item:Q1774168"
From MaRDI portal
The following pages link to The two-dimensional cutting stock problem revisited (Q1774168):
Displaying 4 items.
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
