New Stabilization Procedures for the Cutting Stock Problem

DOI10.1287/ijoc.1100.0415zbMath1243.90248OpenAlexW2160028988MaRDI QIDQ2899145

Cláudio Alves, François Clautiaux, Jürgen Rietz, José M. Valério de Carvalho

Publication date: 28 July 2012

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

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

zbMATH Keywords

integer programmingcombinatorial optimizationcutting stock

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Exact algorithms for the bin packing problem with fragile objects ⋮ Conservative scales in packing problems ⋮ An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem ⋮ Theoretical investigations on maximal dual feasible functions ⋮ Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation

Uses Software

• ACCPM

This page was built for publication: New Stabilization Procedures for the Cutting Stock Problem