Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound

DOI10.1111/j.1475-3995.1998.tb00100.xzbMath0911.90281OpenAlexW2117255974MaRDI QIDQ4212712

José M. Valério de Carvalho

Publication date: 5 May 1999

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1998.tb00100.x

zbMATH Keywords

column generationbranch-and-boundone-dimensional cutting stock

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (16)

Integer linear programming models for the skiving stock problem ⋮ An integrated cutting stock and sequencing problem ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Column generation algorithm for sensor coverage scheduling under bandwidth constraints ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Improving competitiveness in veneers production by a simple-to-use DSS. ⋮ The generalized assortment and best cutting stock length problems ⋮ Scheduling training for a tank battalion: how to measure readiness ⋮ An exact model for a slitting problem in the steel industry ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ The stochastic trim-loss problem ⋮ Column-Generation in Integer Linear Programming ⋮ Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria ⋮ Improved flow-based formulations for the skiving stock problem ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths

Cites Work

• Unnamed Item
• An instance of the cutting stock problem for which the rounding property does not hold
• A polyhedral approach to edge coloring
• Solving binary cutting stock problems by column generation and branch- and-bound
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A typology of cutting and packing problems
• Optimal solutions for the cutting stock problem
• The cutting stock problem and integer rounding

This page was built for publication: Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound