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

Probabilistic analysis of the next fit decreasing algorithm for bin- packing

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

DOI10.1016/0167-6377(87)90018-6zbMath0628.90059OpenAlexW2072813799MaRDI QIDQ1093532

WanSoo T. Rhee

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90018-6


zbMATH Keywords

bin-packingdeterministic inequalityprobabilistic analysis of next fit decreasing


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)


Related Items (2)

Next-fit packs a list and its reverse into the same number of bins ⋮ Average case analysis of bounded space bin packing algorithms



Cites Work

  • A probabilistic analysis of the next fit decreasing bin packing heuristic
  • A stochastic analysis of the NFD bin-packing algorithm
  • A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
  • Probability Inequalities for Sums of Bounded Random Variables


This page was built for publication: Probabilistic analysis of the next fit decreasing algorithm for bin- packing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1093532&oldid=13122841"
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 01:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki