Probabilistic analysis of the next fit decreasing algorithm for bin- packing (Q1093532): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probabilistic analysis of the next fit decreasing bin packing heuristic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A stochastic analysis of the NFD bin-packing algorithm / rank | |||
Normal rank |
Latest revision as of 12:57, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probabilistic analysis of the next fit decreasing algorithm for bin- packing |
scientific article |
Statements
Probabilistic analysis of the next fit decreasing algorithm for bin- packing (English)
0 references
1987
0 references
We use a simple deterministic inequality to simplify and strengthen previous results on the probabilistic analysis of next fit decreasing for bin-packing.
0 references
deterministic inequality
0 references
probabilistic analysis of next fit decreasing
0 references
bin-packing
0 references