An on-line algorithm for multidimensional bin packing
From MaRDI portal
Publication:688930
DOI10.1016/0167-6377(93)90004-ZzbMATH Open0781.90077WikidataQ105583590 ScholiaQ105583590MaRDI QIDQ688930FDOQ688930
Authors: André van Vliet, János Csirik 
Publication date: 1 November 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A simple on-line bin-packing algorithm
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- On-line bin packing in linear time
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Two-dimensional rectangle packing: On-line methods and results
Cited In (33)
- On-line potato-sack algorithm efficient for packing into small boxes
- Title not available (Why is that?)
- Packing d-Dimensional Bins in d Stages
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- A note on the approximability of cutting stock problems
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Two-dimensional online bin packing with rotation
- Online bin packing of squares and cubes
- Assigning service requests in voice-over-internet gateway multiprocessors
- Three-dimensional packings with rotations
- Bounds for online bounded space hypercube packing
- Two-dimensional on-line bin packing problem with rotatable items.
- Approximation and online algorithms for multidimensional bin packing: a survey
- Dynamic multi-dimensional bin packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- On-line bin packing ? A restricted survey
- Parametric on-line algorithms for packing rectangles and boxes.
- Online algorithms for a dual version of bin packing
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Online bin packing of squares and cubes
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- A note on online hypercube packing
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- On-line grid-packing with a single active grid
- Bidimensional packing by bilinear programming
- Cube packing.
- Performance analysis and improvement for some linear on-line bin-packing algorithms
- A tight lower bound for the online bounded space hypercube bin packing problem
- A lower bound for online rectangle packing
- Multidimensional cube packing
- Title not available (Why is that?)
- On a multidimensional semi-on-line bin packing problem
This page was built for publication: An on-line algorithm for multidimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688930)
