The min-conflict packing problem

Document type :
Compte-rendu et recension critique d'ouvrage
DOI :
10.1016/j.cor.2011.10.021
Title :
The min-conflict packing problem
Author(s) :
Khanafer, Ali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Clautiaux, François [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Hanafi, Said [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Talbi, El-Ghazali [Auteur] refId
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Journal title :
Computers and Operations Research
Pages :
2122-2132
Publisher :
Elsevier
Publication date :
2011-10-29
ISSN :
0305-0548
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
In the classical bin-packing problem with conflicts (BPC), the goal is to minimize the number of bins used to pack a set of items subject to disjunction constraints. In this paper, we study a new version of BPC: the ...
Show more >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Harvested from HAL
Files
Thumbnail