Pages that link to "Item:Q4497274"
From MaRDI portal
The following pages link to Pattern reduction in one-dimensional cutting stock problems (Q4497274):
Displaying 29 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (Q319143) (← links)
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← 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)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure (Q2482385) (← links)
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction (Q3093039) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- Optimal job splitting on a multi-slot machine with applications in the printing industry (Q3553743) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries (Q6048506) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
