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

DOI10.1007/S11766-997-0022-YMaRDI QIDQ1364894zbMATH OpenOpenAlexFDO

Authors Zhiping Chen, J. L. de Jong, Cor 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

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

Recommendations

• Solving binary cutting stock problems by column generation and branch- and-bound
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
• Computational study of a column generation algorithm for bin packing and cutting stock problems

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 680242 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• Branch-and-price: Column generation for solving huge integer programs
• Multistage Cutting Stock Problems of Two and More Dimensions
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Solving binary cutting stock problems by column generation and branch- and-bound

Cited in

(8)

• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• A branch-and-cut algorithm for the equicut problem
• Solving the market split problem via branch-and-cut
• An application of deterministic and robust optimization in the wood cutting industry
• A branch-and-price-and-cut method for computing an optimal bramble
• Branch-and-price algorithms for the one-dimensional cutting stock problem

Describes a project that uses

Uses Software

• MINTO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364894)