Pages that link to "Item:Q1886499"
From MaRDI portal
The following pages link to A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499):
Displaying 13 items.
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint (Q2357939) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
- Heuristic methods to consecutive block minimization (Q2664289) (← links)
- Iterated local search for consecutive block minimization (Q2668701) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais (Q3621505) (← links)
- Exponential neighborhood search for consecutive block minimization (Q6082185) (← links)
- Mathematical models for the minimization of open stacks problem (Q6082193) (← links)
