A note on dual approximation algorithms for class constrained bin packing problems

Author： Xavier Eduardo C.   Miyazawa Flàvio Keidi  

Publisher： Edp Sciences

E-ISSN： 1290-385x|43|2|239-248

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.2, 2008-10, pp. : 239-248

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

Abstract

Related content

Primal-dual approximation algorithms for a packing-covering pair of problems

By Kovaleva Sofia   Spieksma Frits C.R.  

RAIRO - Operations Research, Vol. 36, Iss. 1, 2010-03 ,pp. : 53-71

Edp Sciences

Access to resources Recommend Favorite

Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems

By Salhi Abdellah   Proll L.G.   Rios Insua D.   Martin J.I.  

RAIRO - Operations Research, Vol. 34, Iss. 2, 2010-03 ,pp. : 183-197

Edp Sciences

Access to resources Recommend Favorite

Online LIB problems: Heuristics for Bin Covering and lower boundsfor Bin Packing

By Finlay Luke   Manyem Prabhu  

RAIRO - Operations Research, Vol. 39, Iss. 3, 2006-01 ,pp. : 163-183

Edp Sciences

Access to resources Recommend Favorite

Algorithms for the two dimensional bin packing problem with partial conflicts

By Hamdi-Dhaoui Khaoula   Labadie Nacima   Yalaoui Alice  

RAIRO - Operations Research, Vol. 46, Iss. 1, 2012-05 ,pp. : 41-62

Edp Sciences

Access to resources Recommend Favorite

Tractable algorithms for chance-constrained combinatorial problems

By Klopfenstein Olivier  

RAIRO - Operations Research, Vol. 43, Iss. 2, 2009-04 ,pp. : 157-187

Edp Sciences

Access to resources Recommend Favorite