An on-line algorithm for multidimensional bin packing

DOI10.1016/0167-6377(93)90004-ZMaRDI QIDQ688930zbMATH OpenWikidataFDO

Authors André van Vliet, János Csirik

Publication date 1 November 1993

Published in Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

on-line algorithmworst case analysisaverage case analysis\(d\)-dimensional bin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Optimal Online Algorithms for Multidimensional Packing Problems
• Optimal online bounded space multidimensional packing
• Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
• On-line bin packing in linear time

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A lower bound for on-line bin packing
• A simple on-line bin-packing algorithm
• An improved lower bound for on-line bin packing algorithms
• Fast algorithms for bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• On-line bin packing in linear time
• Two-dimensional rectangle packing: On-line methods and results

Cited in

(33)

• Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
• Packing d-Dimensional Bins in d Stages
• Hardness of approximation for orthogonal rectangle packing and covering problems
• A tight lower bound for the online bounded space hypercube bin packing problem
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
• Parametric on-line algorithms for packing rectangles and boxes.
• A lower bound for online rectangle packing
• A note on the approximability of cutting stock problems
• On-line potato-sack algorithm efficient for packing into small boxes
• Two-dimensional online bin packing with rotation
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Multidimensional cube packing
• A note on online hypercube packing
• Approximation and online algorithms for multidimensional bin packing: a survey
• Three-dimensional packings with rotations
• Online bin packing of squares and cubes
• Online bin packing of squares and cubes
• Bidimensional packing by bilinear programming
• Optimal Online Algorithms for Multidimensional Packing Problems
• Online algorithms for a dual version of bin packing
• Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
• scientific article; zbMATH DE number 2016849 (Why is no real title available?)
• Bounds for online bounded space hypercube packing
• On-line grid-packing with a single active grid
• scientific article; zbMATH DE number 5761817 (Why is no real title available?)
• Cube packing.
• Performance analysis and improvement for some linear on-line bin-packing algorithms
• Two-dimensional on-line bin packing problem with rotatable items.
• On a multidimensional semi-on-line bin packing problem
• Dynamic multi-dimensional bin packing
• Assigning service requests in voice-over-internet gateway multiprocessors
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• On-line bin packing ? A restricted survey

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)