A algorithm for two-dimensional packing
From MaRDI portal
Publication:3925883
DOI10.1016/0196-6774(81)90034-1zbMath0472.68032OpenAlexW2031210751MaRDI QIDQ3925883
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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items (46)
Shelf algorithms for on-line strip packing ⋮ Multiple-type, two-dimensional bin packing problems: Applications and algorithms ⋮ Strip packing with precedence constraints and strip packing with release times ⋮ Approximate strip packing: revisited ⋮ The nesting problem in the leather manufacturing industry ⋮ Two for One: Tight Approximation of 2D Bin Packing ⋮ A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ Exhaustive approaches to 2D rectangular perfect packings ⋮ Efficient heuristics for robot acquisition planning for a CIM system ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ An approximation scheme for strip packing of rectangles with bounded dimensions ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ On-line bin packing ? A restricted survey ⋮ A \((5/3+\varepsilon)\)-approximation for strip packing ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ An improved BL lower bound ⋮ Parametric on-line algorithms for packing rectangles and boxes. ⋮ Exact algorithms for the guillotine strip cutting/packing problem. ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Online square packing with gravity ⋮ An algorithm for the three-dimensional packing problem with asymptotic performance analysis ⋮ Oriented aligned rectangle packing problem ⋮ Knowledge based approach to the cutting stock problem ⋮ On some packing problem related to dynamic storage allocation ⋮ TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING ⋮ Dynamic storage allocation with known durations ⋮ Recent advances on two-dimensional bin packing problems ⋮ Fuzzy bin packing problem. ⋮ The two-dimensional cutting stock problem revisited ⋮ Improved approximation for two dimensional strip packing with polynomial bounded width ⋮ Online strip packing with modifiable boxes ⋮ On-line algorithms for packing rectangles into several strips ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks ⋮ On-line grid-packing with a single active grid ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Unnamed Item ⋮ Probabilistic analysis of shelf algorithms for strip packing ⋮ Approximate algorithms to pack rectangles into several strips ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Two-dimensional packing problems: a survey ⋮ Network flows and non-guillotine cutting patterns ⋮ Resource augmentation in two-dimensional packing with orthogonal rotations ⋮ On Packing Two-Dimensional Bins
This page was built for publication: A algorithm for two-dimensional packing
