Algorithms for the two dimensional bin packing problem with partial conflicts

Author： Hamdi-Dhaoui Khaoula   Labadie Nacima   Yalaoui Alice  

Publisher： Edp Sciences

E-ISSN： 1290-3868|46|1|41-62

ISSN： 0399-0559

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

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

Metaheuristics based on Bin Packing for the line balancing problem

By Gourgand Michel   Grangeon Nathalie   Norre Sylvie  

RAIRO - Operations Research, Vol. 41, Iss. 2, 2007-06 ,pp. : 193-211

Edp Sciences

Access to resources Recommend Favorite

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

By Xavier Eduardo C.   Miyazawa Flàvio Keidi  

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

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

Polynomial time algorithms for two classes of subgraph problem

By Sridharan Sriraman  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 291-298

Edp Sciences

Access to resources Recommend Favorite

Edge Detection Algorithms for Two‐Dimensional Ecological Data

By  

Ecology, Vol. 75, Iss. 4, 1994-06 ,pp. : 956-965

John Wiley & Sons Inc

Access to resources Recommend Favorite