Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

DOI10.1137/0210042MaRDI QIDQ3911418zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(17)

• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Oriented aligned rectangle packing problem
• Packing problems
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• The two-dimensional cutting stock problem revisited
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• Two-dimensional packing problems: a survey
• 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
• Approximate strip packing: revisited
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• A (5/3+)-approximation for strip packing
• Closing the Gap for Pseudo-Polynomial Strip Packing
• An improved approximation algorithm for scheduling monotonic moldable tasks
• Recent advances on two-dimensional bin packing problems
• Scheduling parallel jobs to minimize the makespan

This page was built for publication: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

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