A algorithm for two-dimensional packing

DOI10.1016/0196-6774(81)90034-1MaRDI QIDQ3925883zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker, Donna J. Brown, Howard P. Katseff

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90034-1

zbMATH Keywords

rectangles

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(44)

• On-line grid-packing with a single active grid
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• An improved BL lower bound
• Oriented aligned rectangle packing problem
• Knowledge based approach to the cutting stock problem
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• An approximation scheme for strip packing of rectangles with bounded dimensions
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• Parametric on-line algorithms for packing rectangles and boxes.
• Exact algorithms for the guillotine strip cutting/packing problem.
• The two-dimensional cutting stock problem revisited
• Two-dimensional packing problems: a survey
• The nesting problem in the leather manufacturing industry
• Efficient heuristics for robot acquisition planning for a CIM system
• Exhaustive approaches to 2D rectangular perfect packings
• Approximation and online algorithms for multidimensional bin packing: a survey
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
• Resource augmentation in two-dimensional packing with orthogonal rotations
• Approximate strip packing: revisited
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• Shelf algorithms for on-line strip packing
• Two for One: Tight Approximation of 2D Bin Packing
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• On some packing problem related to dynamic storage allocation
• A (5/3+)-approximation for strip packing
• On Packing Two-Dimensional Bins
• Online square packing with gravity
• On-line bin packing ? A restricted survey
• Closing the Gap for Pseudo-Polynomial Strip Packing
• Two for one: tight approximation of 2D bin packing
• On-line algorithms for packing rectangles into several strips
• Probabilistic analysis of shelf algorithms for strip packing
• Approximate algorithms to pack rectangles into several strips
• scientific article; zbMATH DE number 2230208 (Why is no real title available?)
• Dynamic storage allocation with known durations
• Fuzzy bin packing problem.
• Online strip packing with modifiable boxes
• An improved approximation algorithm for scheduling monotonic moldable tasks
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• Recent advances on two-dimensional bin packing problems
• Network flows and non-guillotine cutting patterns
• Strip packing with precedence constraints and strip packing with release times
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

This page was built for publication: A algorithm for two-dimensional packing

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