Two-dimensional online bin packing with rotation
From MaRDI portal
(Redirected from Publication:982663)
Recommendations
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 1696637
- Two-dimensional on-line bin packing problem with rotatable items.
- One-space bounded algorithms for two-dimensional bin packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Cites work
- scientific article; zbMATH DE number 33204 (Why is no real title available?)
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- 25 pretty graph colouring problems
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A lower bound for the non-oriented two-dimensional bin packing problem
- A new upper bound 2.5545 on 2D Online Bin Packing
- A note on online hypercube packing
- A simple on-line bin-packing algorithm
- Absolute approximation ratios for packing rectangles into bins
- An improved lower bound for on-line bin packing algorithms
- An on-line algorithm for multidimensional bin packing
- Bounds for online bounded space hypercube packing
- Fast algorithms for bin packing
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Mathematical Foundations of Computer Science 2003
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New bounds for multidimensional packing
- On Packing Two-Dimensional Bins
- On the online bin packing problem
- On-line bin packing in linear time
- Online square and cube packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Two-dimensional on-line bin packing problem with rotatable items.
- Two-dimensional rectangle packing: On-line methods and results
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(12)- scientific article; zbMATH DE number 1696637 (Why is no real title available?)
- Online bin packing of squares and cubes
- Mathematical Foundations of Computer Science 2003
- Two-dimensional on-line bin packing problem with rotatable items.
- Online packing of rectangular items into square bins
- Approximation and online algorithms for multidimensional bin packing: a survey
- Improved approximation algorithm for two-dimensional bin packing
- Online bin packing of squares and cubes
- A lower bound for online rectangle packing
- Techniques and results on approximation algorithms for packing circles
- A bounded space algorithm for online circle packing
- Online circle and sphere packing
This page was built for publication: Two-dimensional online bin packing with rotation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982663)
