Build (method = -2) #dp: 2545 Step-3' Graph: 120 vertices and 889 arcs (0.01s) Step-4' Graph: 50 vertices and 749 arcs (0.01s) #V4/#V3 = 0.42 #A4/#A3 = 0.84 Ready! (0.01s) Optimize a model with 110 rows, 750 columns and 2154 nonzeros Presolve removed 11 rows and 11 columns Presolve time: 0.01s Presolved: 99 rows, 739 columns, 2003 nonzeros Variable types: 0 continuous, 739 integer (659 binary) Optimize a model with 99 rows, 739 columns and 2003 nonzeros Presolved: 99 rows, 739 columns, 2003 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.059e+03 Factor NZ : 2.388e+03 Factor Ops : 7.578e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.02431274e+03 -2.58063717e+03 5.37e+03 2.68e-01 1.37e+01 0s 1 2.99152455e+02 -6.98107441e+02 5.66e+02 4.44e-16 1.70e+00 0s 2 6.35906073e+01 -7.69454408e+01 6.57e+01 4.44e-16 2.07e-01 0s 3 2.84612091e+01 1.22567593e+00 3.05e+00 6.66e-16 2.28e-02 0s 4 2.47953639e+01 1.23461543e+01 8.05e-01 4.44e-16 9.06e-03 0s 5 2.31724032e+01 1.71793800e+01 4.66e-01 4.44e-16 4.27e-03 0s 6 2.25134909e+01 1.89451534e+01 3.53e-01 2.22e-16 2.55e-03 0s 7 2.07312186e+01 1.95063744e+01 7.76e-02 4.44e-16 8.56e-04 0s 8 2.03028385e+01 1.97050810e+01 2.53e-02 5.55e-16 4.13e-04 0s 9 2.01233487e+01 1.98777105e+01 8.64e-03 8.88e-16 1.69e-04 0s 10 2.00318922e+01 1.99591781e+01 1.33e-03 2.22e-16 4.97e-05 0s 11 2.00103060e+01 1.99831734e+01 3.01e-04 4.44e-16 1.85e-05 0s 12 2.00021634e+01 1.99975747e+01 2.69e-05 4.44e-16 3.12e-06 0s 13 2.00003870e+01 1.99997487e+01 2.07e-06 4.44e-16 4.34e-07 0s 14 2.00000044e+01 1.99999928e+01 8.86e-09 6.66e-16 7.83e-09 0s 15 2.00000000e+01 2.00000000e+01 4.23e-12 6.66e-16 2.70e-13 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 19 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (19 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 20 Solution: 1 x [31, 32, 33] 1 x [5, 16, 18] 1 x [2, 19, 21] 1 x [26, 34, 36] 1 x [10, 11, 12] 1 x [22, 23, 29] 1 x [46, 47, 48] 1 x [55, 56, 57] 1 x [13, 14, 15] 1 x [40, 41, 42] 1 x [49, 50, 51] 1 x [58, 59, 60] 1 x [1, 3, 20] 1 x [4, 6, 17] 1 x [25, 27, 35] 1 x [24, 28, 30] 1 x [7, 8, 9] 1 x [37, 38, 39] 1 x [52, 53, 54] 1 x [43, 44, 45]