Pages that link to "Item:Q1303545"
From MaRDI portal
The following pages link to Heuristic and exact methods for the cutting sequencing problem (Q1303545):
Displaying 11 items.
- 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)
- 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)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← 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)
- A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
- Refinements on an enumeration scheme for solving a pattern sequencing problem (Q3158869) (← links)
- Mathematical models for the minimization of open stacks problem (Q6082193) (← links)
