Optimal Integer Solutions to Industrial Cutting Stock Problems

DOI10.1287/ijoc.11.4.406zbMath1034.90533OpenAlexW2027163021MaRDI QIDQ4427384

Zeger Degraeve, Linus Schrage

Publication date: 6 November 2003

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.11.4.406

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Related Items (12)

A residual recombination heuristic for one-dimensional cutting stock problems ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ The demand weighted vehicle routing problem ⋮ Renovation of the cutting stock process ⋮ One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

This page was built for publication: Optimal Integer Solutions to Industrial Cutting Stock Problems