Multidimensional on-line bin-packing: An algorithm and its average-case analysis

DOI10.1016/0020-0190(93)90253-6zbMATH Open0787.68045OpenAlexW2092098497MaRDI QIDQ1313752FDOQ1313752

Authors: Ee-Chien Chang, Mohan S. Kankanhalli, Weiguo Wang 

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90253-6

zbMATH Keywords

average-case analysisbin packingon-line algorithmsHash packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• The average-case analysis of some on-line algorithms for bin packing
• Title not available (Why is that?)

Cited In (6)

• Assigning service requests in voice-over-internet gateway multiprocessors
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Performance analysis and improvement for some linear on-line bin-packing algorithms
• On-line algorithms for packing rectangles into several strips
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems

This page was built for publication: Multidimensional on-line bin-packing: An algorithm and its average-case analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313752)