Heuristics and lower bounds for the bin packing problem with conflicts

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.