M. Demange, J. Monnot, V. Th, and . Paschos, Maximizing the number of unused bins, Foundation of Computing and Decision Sciences, vol.26, issue.2, pp.145-168, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00004010

M. Demange, Reducing off-line to on-line: An example and its applications, Yugoslav Journal of Operations Research, vol.13, issue.1, pp.3-24, 2003.
DOI : 10.2298/YJOR0301003D

M. Demange, V. Th, and . Paschos, Two-steps combinatorial optimization, Proc. workshop OLCP'01, pp.37-44, 2001.

M. Demange, J. Monnot, V. Th, and . Paschos, Bridging gap between standard and differential polynomial approximation: The case of bin-packing, Applied Mathematics Letters, vol.12, issue.7, pp.127-133, 1999.
DOI : 10.1016/S0893-9659(99)00112-3

M. M. Halldòrsson, Approximations via partitioning. JAIST,Japan Advanced Institute of Science and technology, 1995.

P. Crescenzi and V. Kann, A compendium of NP optimization problems, 1995.

A. Van and . Vliet, An improved lower bound for the on-line bin-packing algorithms, Inform. process. Lett, vol.43, pp.277-284, 1992.

F. M. Liang, A lower bound for on-line bin packing, Information Processing Letters, vol.10, issue.2, pp.76-79, 1980.
DOI : 10.1016/S0020-0190(80)90077-0

M. B. Richey, Improved bounds for harmonic-based bin packing algorithms, Discrete Applied Mathematics, vol.34, issue.1-3, pp.203-225, 1991.
DOI : 10.1016/0166-218X(91)90087-D
URL : http://doi.org/10.1016/0166-218x(91)90087-d

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979.

X. Paradon, Algorithmique on-line, Thèse de doctorat, 2000.

P. Manyem, Bin-packing and covering with longest item at the bottom: the The ANZIAN journal 43 no, E, pp.186-231, 2002.

P. Manyem, R. L. Salt, and . Visser, Lower bound and heuristic for the on-line LIB bin-packing and covering, Proceedings of the thirteenth australian workshop of combinatorial algorithms, 2002.

P. Manyem, Uniform sized Bins 15. L. Finlay and P. Manyem Online LIB problems: Heuristics for the