Two-dimensional bin packing with one-dimensional resource augmentation
From MaRDI portal
Publication:2467124
DOI10.1016/J.DISOPT.2006.09.001zbMATH Open1278.90325OpenAlexW2087645523MaRDI QIDQ2467124FDOQ2467124
Publication date: 18 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.09.001
Cites Work
- Title not available (Why is that?)
- Online algorithms. The state of the art
- Bin packing can be solved within 1+epsilon in linear time
- A near-optimal solution to a two-dimensional cutting stock problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Two-dimensional packing problems: a survey
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
Cited In (4)
- Rectangle packing with one-dimensional resource augmentation
- Approximation and online algorithms for multidimensional bin packing: a survey
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
This page was built for publication: Two-dimensional bin packing with one-dimensional resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467124)
