Branch-and-price algorithms for the one-dimensional cutting stock problem

DOI10.1023/A:1018346107246zbMath0897.90161OpenAlexW1746476868MaRDI QIDQ1380722

Pamela H. Vance

Publication date: 11 March 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018346107246

zbMATH Keywords

column generationbranch-and-boundcutting stockbranch-and-price approaches

Mathematics Subject Classification ID

Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (37)

An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A note on the approximability of cutting stock problems ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ A branch and price algorithm for the pharmacy duty scheduling problem ⋮ A branch and price approach for deployment of multi-tier software services in clouds ⋮ Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Branching in branch-and-price: A generic scheme ⋮ O problema de corte de estoque em indústrias de móveis de pequeno e médio portes ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams ⋮ Decomposition methods for the lot-sizing and cutting-stock problems in paper industries ⋮ The stochastic trim-loss problem ⋮ A hybrid approach for optimization of one-dimensional cutting ⋮ Column-Generation in Integer 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 ⋮ LP models for bin packing and cutting stock 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 ⋮ Evaluation of algorithms for one-dimensional cutting ⋮ Algorithms for the variable sized bin packing problem ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem ⋮ On compact formulations for integer programs solved by column generation

Uses Software

• MINTO

This page was built for publication: Branch-and-price algorithms for the one-dimensional cutting stock problem