Pages that link to "Item:Q1041932"
From MaRDI portal
The following pages link to The one-dimensional cutting stock problem with usable leftover - a heuristic approach (Q1041932):
Displaying 17 items.
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- A linear optimization approach to the combined production planning model (Q647983) (← links)
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach (Q1041932) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- An exact model for a slitting problem in the steel industry (Q2239876) (← 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)
- A heuristic for the one-dimensional cutting stock problem with usable leftover (Q2655612) (← links)
- Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers (Q2675699) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328) (← links)
- A note on handling residual lengths (Q3974424) (← links)
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic (Q4921221) (← links)
- (Q5876187) (← links)
- A stochastic programming approach to the cutting stock problem with usable leftovers (Q6112407) (← links)
