Optimal Integer Solutions to Industrial Cutting Stock Problems
From MaRDI portal
Recommendations
- Optimal solutions for the cutting stock problem
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- scientific article; zbMATH DE number 1050896
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Solving binary cutting stock problems by column generation and branch- and-bound
Cited in
(38)- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- Bethlehem steel combines cutting stock and set covering to enhance customer service
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
- Solving binary cutting stock problems by column generation and branch- and-bound
- The cutting stock problem in a hardboard industry: A case study.
- The demand weighted vehicle routing problem
- Knowledge-based systems for cutting stock problems
- Optimal solutions for the cutting stock problem
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- Cutting aluminium coils with high length variabilities
- A residual recombination heuristic for one-dimensional cutting stock problems
- The reel and sheet cutting problem in paper industry
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- An integrated cutting stock and sequencing problem
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- The generalized assortment and best cutting stock length problems
- Renovation of the cutting stock process
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- scientific article; zbMATH DE number 3885649 (Why is no real title available?)
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem
- Order Allocation for Stock Cutting in the Paper Industry
- The cutting stock problem and integer rounding
- scientific article; zbMATH DE number 3970488 (Why is no real title available?)
- scientific article; zbMATH DE number 1050896 (Why is no real title available?)
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- Cutting Stock Problems
- On the one-dimensional stock cutting problem in the paper tube industry
- Optimal wafer cutting in shuttle layout problems
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- In situ column generation for a cutting-stock problem
This page was built for publication: Optimal Integer Solutions to Industrial Cutting Stock Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427384)
