Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

DOI10.1137/0210042zbMath0461.68076OpenAlexW2083094973MaRDI QIDQ3911418

Igal Golan

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210042

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items

Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Approximate strip packing: revisited, The nesting problem in the leather manufacturing industry, Efficient heuristics for robot acquisition planning for a CIM system, Approximation and online algorithms for multidimensional bin packing: a survey, Scheduling parallel jobs to minimize the makespan, A \((5/3+\varepsilon)\)-approximation for strip packing, An improved approximation algorithm for scheduling monotonic moldable tasks, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Oriented aligned rectangle packing problem, Packing problems, Recent advances on two-dimensional bin packing problems, The two-dimensional cutting stock problem revisited, Average-case performance analysis of a 2D strip packing algorithm -- NFDH, Improved approximation for two dimensional strip packing with polynomial bounded width, Complexity and inapproximability results for parallel task scheduling and strip packing, Closing the Gap for Pseudo-Polynomial Strip Packing, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Two-dimensional packing problems: a survey