A note on the approximability of cutting stock problems

DOI10.1016/j.ejor.2005.09.053zbMath1135.90026OpenAlexW2111519706MaRDI QIDQ2643962

G. F. Cintra, Yoshiko Wakabayashi, Flávio K. Miyazawa, Eduardo Candido Xavier

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.053

zbMATH Keywords

bin packing

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing

Cites Work

• Unnamed Item
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
• An on-line algorithm for multidimensional bin packing
• The modified integer round-up property of the one-dimensional cutting stock problem
• Bin packing can be solved within 1+epsilon in linear time
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• An LP-based approach to cutting stock problems with multiple objectives
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• An improved typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• On Packing Two-Dimensional Bins
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: A note on the approximability of cutting stock problems