47 citations · 50 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2017★ 2 cited
A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs
Tiziano Bacci, Sara Nicoloso
In this paper we deal with the Bin Packing Problem with Conflicts on interval graphs: given an interval graph, a nonnegative integer weight for each vertex, and a nonnegative integ…
math.CO2017★ 1 cited
On the benchmark instances for the Bin Packing with Conflicts
Tiziano Bacci, Sara Nicoloso
Many authors, mainly in the context of the Bin Packing Problem with Conflicts, used the random graph generator proposed in "Heuristics and lower bounds for the bin packing problem…