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

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

Efficient algorithms for real-life instances of the variable size bin packing problemBANG-JENSEN, Jørgen; LARSEN, Rune.Computers & operations research. 2012, Vol 39, Num 11, pp 2848-2857, issn 0305-0548, 10 p.Article

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

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

The three-dimensional bin packing problem and its practical algorithm : Advanced production schedulingJIN, Zhihong; ITO, Takahiro; OHNO, Katsuhisa et al.JSME international journal. Series C, Mechanical systems, machine elements and manufacturing. 2003, Vol 46, Num 1, pp 60-66, issn 1344-7653, 7 p.Article

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

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

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

Lower bounds and reduction procedures for the bin packing problemMARTELLO, S; TOTH, P.Discrete applied mathematics. 1990, Vol 28, Num 1, pp 59-70, issn 0166-218X, 12 p.Article

Dynamic bin packing with unit fraction items revisitedXIN HAN; CHAO PENG; DESHI YE et al.Information processing letters. 2010, Vol 110, Num 23, pp 1049-1054, issn 0020-0190, 6 p.Article

Scheduling Jobs on Grid ProcessorsBOYAR, Joan; FAVRHOLDT, Lene M.Algorithmica. 2010, Vol 57, Num 4, pp 819-847, issn 0178-4617, 29 p.Article

Flyspeck I: Tame graphsNIPKOW, Tobias; BAUER, Gertrud; SCHULTZ, Paula et al.Lecture notes in computer science. 2006, pp 21-35, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 15 p.Conference Paper

Validating Kepler's conjecture : A new approachMUSES, C.Applied mathematics and computation. 2000, Vol 110, Num 1, pp 99-104, issn 0096-3003Article

An exact algorithm for the dual bin packing problemLABBE, M; LAPORTE, G; MARTELLO, S et al.Operations research letters. 1995, Vol 17, Num 1, pp 9-18, issn 0167-6377Article

The parametric behavior of the first-fit decreasing bin packing algorithmCSIRIK, J.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 1-28, issn 0196-6774Article

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