Pages that link to "Item:Q1825753"
From MaRDI portal
The following pages link to A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753):
Displaying 31 items.
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach (Q1041932) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- One-dimensional cutting stock problems and solution procedures (Q1197082) (← links)
- A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
- Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
- Setup minimising conditions in the trim loss problem (Q1278430) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- Optimization of roll cutting in clothing industry (Q1366704) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Cutting aluminium coils with high length variabilities (Q1897383) (← links)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem (Q4603933) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
