The two-dimensional cutting stock problem revisited

DOI10.1007/s10107-004-0548-1zbMath1078.90044OpenAlexW2123179125MaRDI QIDQ1774168

Steven S. Seiden, Gerhard J. Woeginger

Publication date: 29 April 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0548-1

zbMATH Keywords

packing problemstrip packingapproximation schemeworst case analysiscutting stockGuillotine cuts

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (4)

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

Cites Work

• Unnamed Item
• Shelf algorithms for on-line strip packing
• A 2.5 times optimal algorithm for packing in two dimensions
• Bin packing can be solved within 1+epsilon in linear time
• An approximation scheme for strip packing of rectangles with bounded dimensions
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Shelf Algorithms for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
• A algorithm for two-dimensional packing
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Approximation of Numbers as Sums of Reciprocals

This page was built for publication: The two-dimensional cutting stock problem revisited