A branch-and-price algorithm for solving the cutting strips problem

DOI10.1007/s11766-997-0022-yzbMath0882.90108OpenAlexW2059148221MaRDI QIDQ1364894

Zhiping Chen, J. L. de Jong, Cor A. J. Hurkens

Publication date: 28 August 1997

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-branchandprice-algorithm-for-solving-the-cutting-strips-problem(0dc431ab-02db-4e8d-ad39-102645ccf339).html

zbMATH Keywords

column generationcutting stockbranch-and-price algorithmcutting strips problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

An application of deterministic and robust optimization in the wood cutting industry

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving binary cutting stock problems by column generation and branch- and-bound
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: A branch-and-price algorithm for solving the cutting strips problem