Pages that link to "Item:Q4545662"
From MaRDI portal
The following pages link to Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems (Q4545662):
Displaying 13 items.
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- Dynamic-programming-based heuristic for multi-objective operating theater planning (Q2076419) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- Integrated design and operation of remnant inventory supply chains under uncertainty (Q2275828) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- A note on the approximability of cutting stock problems (Q2643962) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)