Pages that link to "Item:Q2655612"
From MaRDI portal
The following pages link to A heuristic for the one-dimensional cutting stock problem with usable leftover (Q2655612):
Displayed 10 items.
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
- Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers (Q2675699) (← links)
- The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic (Q4921221) (← links)
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries (Q6087622) (← links)
- A stochastic programming approach to the cutting stock problem with usable leftovers (Q6112407) (← links)