Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
From MaRDI portal
Recommendations
Cited in
(14)- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Combined cutting stock and lot-sizing problem with pattern setup
- A note on the approximability of cutting stock problems
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Constraint programming-based column generation
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Cutting stock problem with usable leftovers: a review
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
- Dynamic-programming-based heuristic for multi-objective operating theater planning
- Constraint programming-based column generation
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- Integrated design and operation of remnant inventory supply chains under uncertainty
This page was built for publication: Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4545662)