Approximation algorithms for a hierarchically structured bin packing problem

Author： Codenotti B. De Marco G. Leoncini M. Montangero M. Santini M.

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.5, 2004-03, pp. : 215-221

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approximation Algorithms for Extensible Bin Packing

By Coffman E. Lueker George

Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. : 63-69

Springer Publishing Company

Access to resources Recommend Favorite

A linear approximation algorithm for bin packing with absolute approximation factor 32

By Berghammer R. Reuter F.

Science of Computer Programming, Vol. 48, Iss. 1, 2003-07 ,pp. : 67-80

Elsevier

Access to resources Recommend Favorite

A new destructive bounding scheme for the bin packing problem

By Jarboui Bassem

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 187-202

Springer Publishing Company

Access to resources Recommend Favorite

Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem

By Tercinet Fabrice Néron Emmanuel Lenté Christophe

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 297-317

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning bin-packing algorithms for distributed real-time systems

By Niz Dionisio De Rajkumar Raj

International Journal of Embedded Systems, Vol. 2, Iss. 3-4, 2007-08 ,pp. : 196-208

Inderscience Publishers

Access to resources Recommend Favorite