Pages that link to "Item:Q1825768"
From MaRDI portal
The following pages link to Optimal solutions for the cutting stock problem (Q1825768):
Displayed 27 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← 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)
- Solving a cutting problem based on existing patterns (Q1333483) (← links)
- An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
- Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
- Application of optimization for solving a sawing stock problem with a cant sawing pattern (Q1634783) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
- Optimal solutions for the cutting stock problem (Q1825768) (← links)
- A genetic algorithm solution for one-dimensional bundled stock cutting (Q1847176) (← 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)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- Roll assortment optimization in a paper mill: an integer programming approach (Q2384912) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Supply Chain Planning Models in the Pulp and Paper Industry (Q6160205) (← links)
- Using Operational Research for Supply Chain Planning in the Forest Products Industry (Q6160372) (← links)