| Article ID: | iaor20043266 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 347 |
| End Page Number: | 358 |
| Publication Date: | Mar 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Laporte Gilbert, Gendreau Michel, Semet Frdric |
| Keywords: | bin packing |
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.