A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs
Conference Paper
Publication Date:
2017
abstract:
In this paper we design a local search algorithm for the Bin Packing Problem with Con icts on interval graphs. We test the algorithm on thousands of randomly generated instances, and compare the results with existing algorithms.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
Bin Packing with Conflicts; Interval Graphs
List of contributors: