Multiobjective Set Packing Problems (SPP)

Definition

The set Packing problem with two objectives is defined as follow:

Max sum{j=1,…,n} c1(j) x(j)
Max sum{j=1,…,n} c2(j) x(j)
s/t sum{j=1,…,n} t(i,j) x(j) <= 1   for i=1,…,m
    x(j) = 0 or 1                   for j=1,…,n

Datasets

• SPP2002 – Link to the mirror site.