Pages that link to "Item:Q1127215"
From MaRDI portal
The following pages link to Establishing the optimality of sequencing heuristics for cutting stock problems (Q1127215):
Displayed 14 items.
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- The design of the zinc modelling language (Q941812) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- Heuristic and exact methods for the cutting sequencing problem (Q1303545) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)
- Mathematical models for the minimization of open stacks problem (Q6082193) (← links)