int n = ...;
range vertices 1..2*n;
int  cost[vertices,vertices] = ...;

var int leftside[vertices] in 0..1;

minimize
  sum(i in vertices)  sum(j in vertices)leftside[i]*(1-leftside[j])*cost[i,j]

subject to 

  sum(i in vertices) leftside[i] = n;