Build (method = -2) #dp: 4436 Step-3' Graph: 103 vertices and 515 arcs (0.03s) Step-4' Graph: 47 vertices and 403 arcs (0.03s) #V4/#V3 = 0.46 #A4/#A3 = 0.78 Ready! (0.03s) Optimize a model with 93 rows, 404 columns and 1122 nonzeros Presolve removed 24 rows and 28 columns Presolve time: 0.01s Presolved: 69 rows, 376 columns, 1061 nonzeros Variable types: 0 continuous, 376 integer (305 binary) Found heuristic solution: objective 22.0000000 Optimize a model with 69 rows, 376 columns and 1061 nonzeros Presolved: 69 rows, 376 columns, 1061 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.380e+02 Factor NZ : 1.417e+03 Factor Ops : 3.574e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.33245498e+03 -1.18703794e+03 8.80e+02 2.40e-01 9.58e+00 0s 1 3.69152746e+02 -3.34909307e+02 2.12e+02 5.55e-16 2.26e+00 0s 2 5.52950015e+01 -5.90605973e+01 1.67e+01 2.22e-16 2.44e-01 0s 3 2.46818657e+01 3.35875105e+00 7.80e-01 2.22e-16 3.10e-02 0s 4 2.16308562e+01 1.27293264e+01 1.42e-01 3.33e-16 1.19e-02 0s 5 1.95502792e+01 1.62058725e+01 3.33e-02 2.22e-16 4.43e-03 0s 6 1.87843121e+01 1.69648853e+01 1.29e-02 1.11e-16 2.41e-03 0s 7 1.84317097e+01 1.74882282e+01 6.29e-03 3.33e-16 1.25e-03 0s 8 1.81519642e+01 1.77535631e+01 1.73e-03 2.22e-16 5.28e-04 0s 9 1.80502044e+01 1.79038326e+01 5.27e-04 1.34e-16 1.94e-04 0s 10 1.80150901e+01 1.79739223e+01 1.82e-04 2.22e-16 5.45e-05 0s 11 1.80007888e+01 1.79969571e+01 2.85e-06 2.38e-16 5.09e-06 0s 12 1.80000017e+01 1.79999969e+01 1.18e-13 2.22e-16 6.31e-09 0s 13 1.80000000e+01 1.80000000e+01 6.95e-14 2.22e-16 6.32e-15 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.80000000e+01 Root relaxation: objective 1.800000e+01, 131 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 18.0000000 18.00000 0.0% - 0s Explored 0 nodes (156 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.800000000000e+01, best bound 1.800000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.02 seconds Total run time: 0.06 seconds Objective: 18 Solution: 1 x [29, 30, 39] 1 x [5, 25, 33] 1 x [34, 36, 37] 1 x [10, 16, 26] 1 x [12, 31] 1 x [9, 31] 1 x [8, 35, 45] 1 x [6, 17, 23] 1 x [4, 40] 1 x [4, 38] 1 x [2, 14, 27] 1 x [2, 18, 22] 1 x [7, 43, 46] 1 x [7, 13, 28] 1 x [1, 42, 44] 1 x [3, 15, 21] 1 x [24, 32, 41] 1 x [11, 19, 20]