File format

Each instance has the file name in the format X_c_d_i.txt, where

c = class of generation (1 -> 120 nodes, 2 -> 250 nodes, 3 -> 500 nodes, 4 -> 1000 nodes)

X = type of graph (TI -> interval generated with generator of [1], TT -> threshold generated with generator of [2], TA and TAd -> arbitrary generated with generator of [3])

d = graph density ( if X \in {TT,TI,TA} then 1 -> 2%, 2 -> 8%, 3 -> 18%, 4 -> 32%, 5 -> 50%, 6 -> 68%, 7 -> 82%, 8 -> 92%, 9 -> 98% ) 
                  ( if X = TAd then 1 -> 10%, 2 -> 20%, 3 -> 30%, 4 -> 40%, 5 -> 50%, 6 -> 60%, 7 -> 70%, 8 -> 80%, 9 -> 90% )

For each class and for each type of graph, 10 instances are generated, one for each value of the density.

Each instance has the following format

n B
1 p_1 c_1[1] c_1[2] .... c_1[k_1]
2 p_2 c_2[1] c_2[2] .... c_2[k_2]
3 p_3 c_3[1] c_3[2] .... c_3[k_3]
.
.
.
n p_n c_n[1] c_n[2] .... c_n[k_n]


where "n" is the number of nodes, "B" is the bound limit on the bin capacity, 
"p_i" is the weight of the i^th node (the weights used are exactly those of the instances presented in [4]),
vector "c_i" collects all the nodes that are in conflict with the i^th node (k_i = dimension of vector c_i).

References

[1] Bacci, T., Nicoloso, S.: A heuristic algorithm for the bin packing problem with conflicts on
interval graphs (2017). arXiv:1707.00496 [math.CO]

[2] Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing prob-
lem with conflicts. Computers & Operations Research 31, 347–358 (2004)

[3] Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic Branch-and-Price algo-
rithm. INFORMS Journal on Computing 25(2), 244–255 (2013)

[4] Muritiba, F.A.E., Iori, M., Malaguti, E., Toth, P.: Algorithms for the bin packing problem with
conflicts. INFORMS Journal on Computing 22(3), 401–415 (2010)