Average-Case Analysis for the Probabilistic Bin Packing Problem

Author(s):  
Monia Bellalouna ◽  
Salma Souissi ◽  
Bernard Ycart



COMBINATORICA ◽  
1986 ◽  
Vol 6 (2) ◽  
pp. 179-200 ◽  
Author(s):  
Peter W. Shor


1993 ◽  
Vol 48 (3) ◽  
pp. 121-125 ◽  
Author(s):  
Ee-Chien Chang ◽  
Weiguo Wang ◽  
Mohan S. Kankanhalli


2015 ◽  
Vol 1 (2) ◽  
pp. 14-21
Author(s):  
Nguyen Trong

A generalization of the bin packing problem, called the DTMR problem is studied. The NP-completeness of  DTMR is proved. Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given. Some applications of the DTMR are shown.



Algorithmica ◽  
2007 ◽  
Vol 50 (1) ◽  
pp. 72-97 ◽  
Author(s):  
Nir Naaman ◽  
Raphael Rom


2019 ◽  
Vol 261 ◽  
pp. 63-77 ◽  
Author(s):  
Luca Bertazzi ◽  
Bruce Golden ◽  
Xingyin Wang


1994 ◽  
Vol 42 (2) ◽  
pp. 287-298 ◽  
Author(s):  
Shoshana Anily ◽  
Julien Bramel ◽  
David Simchi-Levi


Sign in / Sign up

Export Citation Format

Share Document