Probabilistic analysis of a bin covering algorithm (Q1919189): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a dual version of the one-dimensional bin packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3347319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic analysis of algorithms for dual bin packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recurrence properties of Processes with stationary independent increments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Bin Covering with Items of Random Size / rank | |||
Normal rank | |||
Latest revision as of 13:52, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of a bin covering algorithm |
scientific article |
Statements
Probabilistic analysis of a bin covering algorithm (English)
0 references
1 August 1996
0 references
bin packing
0 references
NP-hard
0 references
heuristic
0 references
iterated-lowest-fit-decreasing
0 references
bin covering
0 references
asymptotic average-case behavior
0 references
0 references
