Pages that link to "Item:Q1777156"
From MaRDI portal
The following pages link to A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156):
Displaying 26 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- One-dimensional cutting stock optimization in consecutive time periods (Q858441) (← 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 new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← 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 one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- A heuristic for the one-dimensional cutting stock problem with usable leftover (Q2655612) (← links)
- An evolutionary algorithm of one dimensional stock cutting problem based on variable length coding (Q2764346) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934) (← links)
- The generalized assortment and best cutting stock length problems (Q3002687) (← links)
- Renovation of the cutting stock process (Q3055385) (← links)
- (Q3147525) (← links)
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths (Q3569837) (← links)
- Optimization of a line-cutting procedure for ship hull construction by an effective tabu search (Q3605417) (← links)
- (Q3691401) (← links)
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach (Q3804426) (← links)
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529) (← links)
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem (Q4834077) (← links)