Optimal solutions for the cutting stock problem

DOI10.1016/0377-2217(90)90355-FzbMath0684.90082MaRDI QIDQ1825768

Constantine Goulimis

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch and boundcutting planescutting stock

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)

Related Items (27)

Solving binary cutting stock problems by column generation and branch- and-bound ⋮ Procedures for solving a 1-dimensional cutting problem ⋮ Solving a cutting problem based on existing patterns ⋮ A branch-and-price-and-cut algorithm for the pattern minimization problem ⋮ An interactive technique for the cutting stock problem with multiple objectives ⋮ Application of optimization for solving a sawing stock problem with a cant sawing pattern ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Roll assortment optimization in a paper mill: an integer programming approach ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ In situ column generation for a cutting-stock problem ⋮ A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry ⋮ Supply Chain Planning Models in the Pulp and Paper Industry ⋮ Using Operational Research for Supply Chain Planning in the Forest Products Industry ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Pattern minimisation in cutting stock problems ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ A hybrid approach for optimization of one-dimensional cutting ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls ⋮ An LP-based approach to cutting stock problems with multiple objectives ⋮ Optimal solutions for the cutting stock problem ⋮ Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound ⋮ A genetic algorithm solution for one-dimensional bundled stock cutting ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ Evaluation of algorithms for one-dimensional cutting ⋮ One-dimensional cutting stock problem to minimize the number of different patterns ⋮ Enforcing minimum run length in the cutting stock problem

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• The trim-loss and assortment problems: A survey
• Optimal solutions for the cutting stock problem
• Mathematical Methods of Organizing and Planning Production
• A Linear Programming Approach to the Cutting-Stock Problem
• Uncapacitated lot-sizing: The convex hull of solutions
• The cutting stock problem and integer rounding
• A New Linear Programming Approach to the Cutting Stock Problem
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• An Algorithm for Two-Dimensional Cutting Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem

This page was built for publication: Optimal solutions for the cutting stock problem