Build (method = -2) #dp: 5685 Step-3' Graph: 536 vertices and 2020 arcs (0.04s) Step-4' Graph: 181 vertices and 1310 arcs (0.04s) #V4/#V3 = 0.34 #A4/#A3 = 0.65 Ready! (0.04s) Optimize a model with 241 rows, 1311 columns and 3575 nonzeros Presolve removed 45 rows and 45 columns Presolve time: 0.01s Presolved: 196 rows, 1266 columns, 3574 nonzeros Variable types: 0 continuous, 1266 integer (1032 binary) Found heuristic solution: objective 40.0000000 Optimize a model with 196 rows, 1266 columns and 3574 nonzeros Presolved: 196 rows, 1266 columns, 3574 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.874e+03 Factor NZ : 5.385e+03 Factor Ops : 1.927e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.00084338e+03 -4.86123003e+03 1.09e+04 2.71e-01 1.59e+01 0s 1 7.28810840e+02 -1.27418322e+03 1.69e+03 6.66e-16 2.59e+00 0s 2 1.18202613e+02 -2.93025946e+02 1.46e+02 5.55e-16 2.98e-01 0s 3 4.90577572e+01 -5.54192229e+01 3.31e+01 6.66e-16 6.99e-02 0s 4 2.67538867e+01 -5.08657696e+00 2.72e+00 6.66e-16 1.44e-02 0s 5 2.41126726e+01 9.57768095e+00 1.10e+00 3.69e-16 6.10e-03 0s 6 2.14696052e+01 1.57821544e+01 2.47e-01 3.33e-16 2.29e-03 0s 7 2.07543830e+01 1.89906422e+01 7.98e-02 4.44e-16 7.05e-04 0s 8 2.02618618e+01 1.94901707e+01 1.93e-02 3.19e-16 3.07e-04 0s 9 2.01027183e+01 1.97988585e+01 4.78e-03 4.44e-16 1.20e-04 0s 10 2.00375917e+01 1.99380742e+01 8.02e-04 5.55e-16 3.94e-05 0s 11 2.00162674e+01 1.99840114e+01 1.82e-04 3.33e-16 1.28e-05 0s 12 2.00092306e+01 1.99995066e+01 5.91e-05 3.75e-16 3.85e-06 0s 13 2.00068252e+01 2.00039296e+01 1.95e-05 4.44e-16 1.15e-06 0s 14 2.00064614e+01 2.00047340e+01 1.37e-05 3.05e-16 6.83e-07 0s 15 2.00057881e+01 2.00054354e+01 3.50e-06 5.60e-16 1.40e-07 0s 16 2.00055454e+01 2.00055433e+01 1.36e-13 3.33e-16 8.52e-10 0s 17 2.00055440e+01 2.00055440e+01 1.24e-13 3.33e-16 1.14e-15 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 2.00055440e+01 Root relaxation: objective 2.000554e+01, 105 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00554 0 79 40.00000 20.00554 50.0% - 0s H 0 0 21.0000000 20.00554 4.74% - 0s Explored 0 nodes (180 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.05 seconds Total run time: 0.10 seconds Objective: 21 Solution: 1 x [34, 35, 36] 1 x [7, 53, 57] 1 x [27, 52, 59] 1 x [16, 26, 43] 1 x [40, 41, 42] 1 x [11, 31, 33] 1 x [13, 17, 54] 1 x [14, 48, 58] 1 x [22, 23, 24] 1 x [29, 46, 51] 1 x [30] 1 x [2, 21, 45] 1 x [4, 5, 6] 1 x [1, 38, 60] 1 x [3, 39] 1 x [18, 28, 47] 1 x [20, 32, 49] 1 x [10, 44, 56] 1 x [12, 50, 55] 1 x [9, 15, 25] 1 x [8, 19, 37]