Build (method = -2) #dp: 3548 Step-3' Graph: 128 vertices and 1041 arcs (0.02s) Step-4' Graph: 112 vertices and 1009 arcs (0.02s) #V4/#V3 = 0.88 #A4/#A3 = 0.97 Ready! (0.02s) Optimize a model with 132 rows, 1010 columns and 2815 nonzeros Presolve removed 8 rows and 15 columns Presolve time: 0.01s Presolved: 124 rows, 995 columns, 2797 nonzeros Variable types: 0 continuous, 995 integer (0 binary) Found heuristic solution: objective 314.0000000 Optimize a model with 124 rows, 995 columns and 2797 nonzeros Presolved: 124 rows, 995 columns, 2797 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.683e+03 Factor NZ : 3.828e+03 Factor Ops : 1.401e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.13795115e+03 -2.70993416e+04 2.64e+04 2.22e-16 1.02e+02 0s 1 1.27374342e+03 -1.15362332e+04 4.89e+03 7.77e-16 2.05e+01 0s 2 5.18958317e+02 -4.51303588e+03 8.41e+02 1.78e-15 4.50e+00 0s 3 3.42885648e+02 -1.03322759e+03 3.92e+01 2.15e-14 7.43e-01 0s 4 2.51821737e+02 -5.25193149e+02 1.24e+01 1.14e-14 4.00e-01 0s 5 1.79171997e+02 -4.91318241e+02 6.53e+00 1.04e-14 3.41e-01 0s 6 1.30021427e+02 -1.88373972e+02 4.32e+00 4.22e-15 1.62e-01 0s 7 1.03416502e+02 -7.62441708e+01 2.78e+00 2.00e-15 9.12e-02 0s 8 8.31890885e+01 1.81408120e+01 1.21e+00 4.44e-16 3.28e-02 0s 9 7.68276682e+01 4.46316449e+01 7.30e-01 4.44e-16 1.62e-02 0s 10 7.13623053e+01 5.95784341e+01 3.11e-01 4.02e-16 5.92e-03 0s 11 6.78802104e+01 6.53501081e+01 1.50e-02 4.22e-16 1.26e-03 0s 12 6.74454071e+01 6.66004548e+01 2.88e-03 4.29e-16 4.21e-04 0s 13 6.73450134e+01 6.71926145e+01 7.52e-04 5.22e-16 7.59e-05 0s 14 6.73068406e+01 6.72743970e+01 1.10e-04 3.67e-16 1.61e-05 0s 15 6.73000016e+01 6.72999827e+01 3.72e-09 3.69e-16 9.39e-09 0s 16 6.73000000e+01 6.73000000e+01 2.94e-14 4.55e-16 9.59e-15 0s Barrier solved model in 16 iterations and 0.02 seconds Optimal objective 6.73000000e+01 Root relaxation: objective 6.730000e+01, 537 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 67.30000 0 42 314.00000 67.30000 78.6% - 0s H 0 0 73.0000000 67.30000 7.81% - 0s H 0 0 69.0000000 67.30000 2.46% - 0s H 0 0 68.0000000 67.30000 1.03% - 0s Explored 0 nodes (886 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.800000000000e+01, best bound 6.800000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.08 seconds Total run time: 0.10 seconds Objective: 68 Solution: 8 x [3, 6, 6, 17, 17] 1 x [3, 7, 16, 17, 17, 18] 3 x [3, 3, 5, 15, 17] 5 x [8, 10, 13, 13, 14, 18] 4 x [9, 10, 13, 15, 17, 19] 1 x [10, 11, 11] 1 x [10, 11, 11, 11] 4 x [6, 7, 11, 19] 1 x [1, 4, 4, 19] 4 x [5, 6, 9, 11, 20] 7 x [4, 4, 5, 6, 15, 17] 4 x [1, 7, 11, 15, 20] 4 x [1, 2, 2, 7, 11, 12] 5 x [2, 5, 7, 9, 12, 20] 1 x [7, 16, 17, 17, 18] 4 x [1, 5, 7, 7, 9] 3 x [5, 9, 11, 11, 11] 4 x [4, 4, 4, 5, 5, 18] 4 x [9, 9, 9, 12, 12, 15]