Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1313752
Jump to:navigation, search

DOI10.1016/0020-0190(93)90253-6zbMath0787.68045OpenAlexW2092098497MaRDI QIDQ1313752

Mohan S. Kankanhalli, Ee-Chien Chang, Wei-Guo 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

on-line algorithmsaverage-case analysisbin packingHash packing


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (3)

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 ⋮ On-line algorithms for packing rectangles into several strips



Cites Work

  • The average-case analysis of some on-line algorithms for bin packing
  • Multidimensional on-line bin packing: Algorithms and worst-case analysis
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1313752&oldid=13429667"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki