Library of numerical instances (MOMIP, MOLP, MOIP, MOCO)
The set partitioning problem with two objectives is defined as follow:
Min sum{j=1,…,n} c1(j) x(j)
Min 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
with 2 objectives: