Pages that link to "Item:Q3779982"
From MaRDI portal
The following pages link to An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry (Q3779982):
Displayed 18 items.
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Heuristics for sequencing cutting patterns (Q807386) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- Establishing the optimality of sequencing heuristics for cutting stock problems (Q1127215) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- On a pattern sequencing problem to minimize the maximum number of open stacks (Q1278124) (← links)
- Heuristic and exact methods for the cutting sequencing problem (Q1303545) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- Improved heuristics for sequencing cutting patterns (Q1390257) (← links)
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Heuristic methods to consecutive block minimization (Q2664289) (← links)
- Iterated local search for consecutive block minimization (Q2668701) (← 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)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
- Exponential neighborhood search for consecutive block minimization (Q6082185) (← links)