Pages that link to "Item:Q2643962"
From MaRDI portal
The following pages link to A note on the approximability of cutting stock problems (Q2643962):
Displaying 12 items.
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths (Q2884299) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- The cutting stock problem and integer rounding (Q3710296) (← links)
- (Q4319397) (← links)
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems (Q4545662) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property (Q5090148) (← links)
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025) (← links)
