Title of article
Heuristics and lower bounds for the bin packing problem with conflicts
Author/Authors
Michel Gendreau، نويسنده , , Gilbert Laporte، نويسنده , , Frédéric Semet، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
12
From page
347
To page
358
Abstract
In the bin packing problem with conflicts, the aim is to pack items into the minimum number of bins subject to incompatibility restrictions. Two lower bounding procedures and six heuristics for this problem are developed and compared.
Keywords
Lower bounds , Heuristics , Bin Packing problem
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928024
Link To Document