Probabilistic analysis of algorithms for dual bin packing problems

Journal of Algorithms

Volumn 12, Issue 2, 1991, Pages 189-203

  Csirik, J ^a   Frenk, J B G ^b   Galambos, G ^a   Rinnooy Kan, A H G ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013459301     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(91)90001-F     Document Type: Article

References (13)

1. Problems in Discrete Applied Mathematics
2. On a dual version of the one-dimensional binpacking problem
3. On Banach Algebras, Renewal Measures and Regenerative Processes
4. On a Pairing Heuristic in Binpacking
5. A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit
6. An Average Case Analysis of Bin Packing with Uniformly Distributed Item Sizes
7. A dual version of binpacking