Build (method = -2)
#dp: 347
Step-3' Graph: 57 vertices and 164 arcs (0.00s)
Step-4' Graph: 49 vertices and 148 arcs (0.00s)
#V4/#V3 = 0.86
#A4/#A3 = 0.90
Ready! (0.00s)
Optimize a model with 61 rows, 149 columns and 353 nonzeros
Presolve removed 31 rows and 72 columns
Presolve time: 0.00s
Presolved: 30 rows, 77 columns, 203 nonzeros
Variable types: 0 continuous, 77 integer (0 binary)
Found heuristic solution: objective 414.0000000
Optimize a model with 30 rows, 77 columns and 203 nonzeros
Presolved: 30 rows, 77 columns, 203 nonzeros
Root barrier log...
Ordering time: 0.00s
Barrier statistics:
AA' NZ : 1.410e+02
Factor NZ : 3.530e+02
Factor Ops : 5.087e+03 (less than 1 second per iteration)
Threads : 1
Objective Residual
Iter Primal Dual Primal Dual Compl Time
0 4.19136081e+02 -3.43625601e+03 3.24e+03 9.09e-02 1.09e+02 0s
1 4.46846005e+02 -5.58785915e+02 3.07e+02 1.44e-15 1.30e+01 0s
2 4.07093734e+02 2.16530333e+02 3.76e+01 9.99e-16 1.74e+00 0s
3 4.15355197e+02 3.73312232e+02 1.52e+00 9.16e-16 2.78e-01 0s
4 4.14153589e+02 4.13567177e+02 9.24e-14 1.33e-15 3.64e-03 0s
Barrier performed 4 iterations in 0.00 seconds
Objective cutoff exceeded
Root relaxation: cutoff, 0 iterations, 0.00 seconds
Explored 0 nodes (0 simplex iterations) in 0.00 seconds
Thread count was 1 (of 8 available processors)
Optimal solution found (tolerance 0.00e+00)
Best objective 4.140000000000e+02, best bound 4.140000000000e+02, gap 0.0%
Preprocessing time: 0.01 seconds
Gurobi run time: 0.00 seconds
Total run time: 0.01 seconds
Objective: 414
Solution:
2 x [1, 2, 3, 4, 6, 7, 8, 9]
2 x [1, 3, 4, 6, 7, 8, 9]
6 x [2, 5, 6, 8, 9, 10, 11, 12]
22 x [3, 6, 7, 8, 9]
8 x [5, 6, 8, 9, 10]
338 x [6]
4 x [6, 7, 8, 9, 10, 11]
26 x [6, 8]
3 x [6, 8, 9]
2 x [6, 8, 9, 10, 11, 12]
1 x [6, 8, 9, 11]