An approximation scheme for strip packing of rectangles with bounded dimensions
From MaRDI portal
Publication:1383370
DOI10.1016/S0166-218X(97)00130-3zbMath0894.68114MaRDI QIDQ1383370
Wenceslas Fernandez de la Vega, Vassilios Zissimopoulos
Publication date: 12 August 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
05B40: Combinatorial aspects of packing and covering
68R99: Discrete mathematics in relation to computer science
Related Items
An exact method for the 2D guillotine strip packing problem, Strip packing with precedence constraints and strip packing with release times, An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension, The two-dimensional cutting stock problem revisited, Two-dimensional packing problems: a survey, A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
Cites Work
- Bin packing can be solved within 1+epsilon in linear time
- Time bounds for selection
- Integer Programming with a Fixed Number of Variables
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- The NP-completeness column: An ongoing guide