Cbc0001I Search completed - best objective 589.

9999615202398, took 18455 iterations

and 680 nodes (133.82 seconds)
Cbc0032I Strong branching done 144 times (6903 iterations), fathomed 0 nodes and
fixed 13 variables
Cbc0035I Maximum depth 79, 0 variables fixed on reduced cost

"Finished"

bonmin: Optimal
Tj = 590

X [*,*]
: 1 2 3 4 5 6 7 8 9 10 11 12 :=
1 0 0 1 0 0 0 0 0 0 0 0 0
2 1 0 0 0 0 0 0 0 0 0 0 0
3 0 1 0 0 0 0 0 0 0 0 0 0
4 0 0 0 1 0 0 0 0 0 0 0 0
5 0 0 0 0 1 0 0 0 0 0 0 0
6 0 0 0 0 0 0 1 0 0 0 0 0
7 0 0 0 0 0 1 0 0 0 0 0 0
8 0 0 0 0 0 0 0 1 0 0 0 0
9 0 0 0 0 0 0 0 0 1 0 0 0
10 0 0 0 0 0 0 0 0 0 0 0 1
11 0 0 0 0 0 0 0 0 0 1 0 0
12 0 0 0 0 0 0 0 0 0 0 1 0
;

: D C P T :=
0 . 0 . .
1 150 30 100 20
2 60 70 30 0
3 80 170 40 0
4 230 250 80 20
5 360 350 100 0
6 400 390 85 75
7 420 475 40 0
8 520 555 80 35
9 580 615 60 35
10 500 695 120 365
11 680 745 80 15
12 720 865 50 25
;