Pages that link to "Item:Q1847195"
From MaRDI portal
The following pages link to Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195):
Displaying 13 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
- One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
