Partially dynamic bin packing can be solved within 1 + ε in (amortized) polylogarithmic timeIVKOVIC, Z; LLOYD, E. L.Information processing letters. 1997, Vol 63, Num 1, pp 45-50, issn 0020-0190Article

Fully dynamic algorithms for bin packing : Being (mostly) myopic helpsIVKOVIC, Z; LLOYD, E. L.SIAM journal on computing (Print). 1999, Vol 28, Num 2, pp 574-611, issn 0097-5397Article

A fundamental restriction on fully dynamic maintenance of bin packingIVKOVIC, Z; LLOYD, E. L.Information processing letters. 1996, Vol 59, Num 4, pp 229-232, issn 0020-0190Article

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientationCARLIER, Jacques; CLAUTIAUX, Francois; MOUKRIM, Aziz et al.Computers & operations research. 2007, Vol 34, Num 8, pp 2223-2250, issn 0305-0548, 28 p.Article

Random sequential bisection and its associated binary treeSIBUYA, M; ITOH, Y.Annals of the Institute of Statistical Mathematics. 1987, Vol 39, Num 1, pp 69-84, issn 0020-3157Article

To block or not to block?ROMERO, Alejandro Gonzalez; ALQU, Rend; ZAR et al.Lecture notes in computer science. 2004, pp 134-143, issn 0302-9743, isbn 3-540-23806-9, 10 p.Conference Paper

A new lower bound for the non-oriented two-dimensional bin-packing problemCLAUTIAUX, Francois; JOUGLET, Antoine; EL HAYEK, Joseph et al.Operations research letters. 2007, Vol 35, Num 3, pp 365-373, issn 0167-6377, 9 p.Article

An approximation algorithm for stacking up bins from a conveyer onto palletsRETHMANN, J; WANKE, E.Lecture notes in computer science. 1997, pp 440-449, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A Robust APTAS for the Classical Bin Packing ProblemEPSTEIN, Leah; LEVIN, Asaf.Lecture notes in computer science. 2006, pp 214-225, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Two dimensional packing: The power of rotationEPSTEIN, Leah.Lecture notes in computer science. 2003, pp 398-407, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Some properties in the packing of equal circles in a squareMOLLARD, M; PAYAN, C.Discrete mathematics. 1990, Vol 84, Num 3, pp 303-307, issn 0012-365XArticle

Heuristics with a new block strategy for the single and multiple containers loading problemsKANG, M.-K; JANG, C.-S; YOON, K.-S et al.The Journal of the Operational Research Society. 2010, Vol 61, Num 1, pp 95-107, issn 0160-5682, 13 p.Article

Packing edge disjoint triangles: A parameterized- viewMATHIESON, Luke; PRIETO, Elena; SHAW, Peter et al.Lecture notes in computer science. 2004, pp 127-137, issn 0302-9743, isbn 3-540-23071-8, 11 p.Conference Paper

Approximation schemes for ordered vector packing problemsCAPRARA, Alberto; KELLERER, Hans; PFERSCHY, Ulrich et al.Lecture notes in computer science. 2001, pp 63-74, issn 0302-9743, isbn 3-540-42470-9Conference Paper

Online bin coloringKRUMKE, Sven O; DE PAEPE, Willem E; RAMBAU, Jörg et al.Lecture notes in computer science. 2001, pp 74-85, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On the constrained rectangle packing problemGEORGIS, N; PETROU, M; KITTLER, J et al.International journal of modelling & simulation. 2000, Vol 20, Num 4, pp 293-299, issn 0228-6203Article

A 13/12 approximation algorithm for bin packing with extendable binsDELL'OLMO, P; KELLERER, H; SPERANZA, M. G et al.Information processing letters. 1998, Vol 65, Num 5, pp 229-233, issn 0020-0190Article

Bin packing using semi-ordinal dataLIU, W.-P; SIDNEY, J. B.Operations research letters. 1996, Vol 19, Num 3, pp 101-104, issn 0167-6377Article

Does randomization help in on-line bin packing?BARUN CHANDRA.Information processing letters. 1992, Vol 43, Num 1, pp 15-19, issn 0020-0190Article

Analysis of a compound bin packing algorithmFRIESEN, D. K; LANGSTON, M. A.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 1, pp 61-79, issn 0895-4801Article

The minimum of gaps generated by random packing of unit intervals into a large intervalMORRISON, J. A.SIAM journal on applied mathematics (Print). 1987, Vol 47, Num 2, pp 398-410, issn 0036-1399Article

Computing curves bounding trigonometric planar maps : Symbolic and hybrid methodsLICHTBLAU, Daniel.Lecture notes in computer science. 2006, pp 70-91, issn 0302-9743, isbn 3-540-31332-X, 1Vol, 22 p.Conference Paper

The Class Constrained Bin Packing Problem with Applications to Video-on-DemandXAVIER, E. C; MIYAZAWA, F. K.Lecture notes in computer science. 2006, pp 439-448, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

New bounds for variable-sized and resource augmented online bin packingEPSTEIN, Leah; SEIDEN, Steve; VAN STEE, Rob et al.Lecture notes in computer science. 2002, pp 306-317, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Apports du Bin-packing et de la programmation par contraintes pour l'ordonnancement d'un atelier d'imprimerie = Avantages of the bin packing and constraint programming for printing workshop schedulingMARCON, Eric.Journal européen des systèmes automatisés. 2001, Vol 35, Num 6, pp 783-807, issn 1269-6935Article