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.
A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs
Bacci T;Nicoloso S
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
