Pages that link to "Item:Q3002687"
From MaRDI portal
The following pages link to The generalized assortment and best cutting stock length problems (Q3002687):
Displaying 12 items.
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- A search strategy for the one-size assortment problem (Q1330558) (← links)
- A spreadsheet modelling approach to the assortment problem (Q1809826) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- (Q3690563) (← links)
- A note on handling residual lengths (Q3974424) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)