Build (method = -2) #dp: 1843 Step-3' Graph: 88 vertices and 787 arcs (0.01s) Step-4' Graph: 87 vertices and 785 arcs (0.01s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 127 rows, 786 columns and 2188 nonzeros Presolve removed 31 rows and 32 columns Presolve time: 0.02s Presolved: 96 rows, 754 columns, 2162 nonzeros Variable types: 0 continuous, 754 integer (473 binary) Found heuristic solution: objective 30.0000000 Optimize a model with 96 rows, 754 columns and 2162 nonzeros Presolved: 96 rows, 754 columns, 2162 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.585e+03 Factor NZ : 3.419e+03 Factor Ops : 1.606e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.71441345e+03 -2.52967591e+03 1.91e+03 2.42e-01 1.47e+01 0s 1 5.13735063e+02 -9.97688405e+02 4.87e+02 5.55e-16 3.81e+00 0s 2 1.12872065e+02 -2.92792546e+02 6.20e+01 4.44e-16 5.80e-01 0s 3 4.24848870e+01 -3.80872359e+01 4.77e+00 4.44e-16 7.10e-02 0s 4 2.97889392e+01 1.85030179e+00 1.24e+00 4.44e-16 2.14e-02 0s 5 2.43284117e+01 1.13437387e+01 2.14e-01 3.36e-16 8.93e-03 0s 6 2.32260069e+01 1.71603793e+01 1.31e-01 3.08e-16 4.15e-03 0s 7 2.23381611e+01 1.92723091e+01 8.13e-02 4.44e-16 2.09e-03 0s 8 2.20095040e+01 1.99299418e+01 5.99e-02 4.44e-16 1.42e-03 0s 9 2.10760995e+01 2.07266929e+01 1.98e-03 6.66e-16 2.32e-04 0s 10 2.10019943e+01 2.09915274e+01 5.77e-06 2.51e-16 6.92e-06 0s 11 2.10000001e+01 2.09999995e+01 3.96e-10 4.44e-16 3.86e-10 0s 12 2.10000000e+01 2.10000000e+01 1.64e-13 3.90e-16 4.04e-16 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 2.10000000e+01 Root relaxation: objective 2.100000e+01, 325 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 21.0000000 21.00000 0.0% - 0s Explored 0 nodes (325 simplex iterations) in 0.04 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.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 21 Solution: 1 x [10, 40] 1 x [9, 39] 1 x [5, 8, 39] 2 x [15, 38] 1 x [4, 12, 38] 1 x [1, 11, 37] 1 x [13, 36] 1 x [16, 35] 1 x [14, 35] 1 x [6, 14, 34] 1 x [17, 33] 1 x [19, 32] 1 x [20, 31] 1 x [22, 30] 1 x [3, 21, 29] 1 x [24, 28] 1 x [7, 19, 28] 1 x [25, 27] 1 x [2, 25, 26] 1 x [11, 18, 23]