Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm

DOI10.1057/palgrave.jors.2601242zbMath1131.90432OpenAlexW2073944685MaRDI QIDQ4658529

No author found.

Publication date: 16 March 2005

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601242

zbMATH Keywords

linear programminginteger programmingcolumn generationcutting planescutting stock problem

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (9)

Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Large gaps in one-dimensional cutting stock problems ⋮ The stochastic trim-loss problem ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

This page was built for publication: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm