Build (method = -2) #dp: 692 Step-3' Graph: 52 vertices and 147 arcs (0.00s) Step-4' Graph: 5 vertices and 53 arcs (0.00s) #V4/#V3 = 0.10 #A4/#A3 = 0.36 Ready! (0.00s) Optimize a model with 22 rows, 54 columns and 158 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 20 rows, 52 columns, 154 nonzeros Variable types: 0 continuous, 52 integer (0 binary) Found heuristic solution: objective 175.0000000 Optimize a model with 20 rows, 52 columns and 154 nonzeros Presolved: 20 rows, 52 columns, 154 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.400e+01 Factor NZ : 2.100e+02 Factor Ops : 2.870e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.50664258e+02 -4.84113605e+02 1.42e+01 0.00e+00 1.41e+01 0s 1 1.12690067e+02 -1.29556633e+02 4.73e-01 5.55e-16 2.14e+00 0s 2 7.21674648e+01 1.47462481e+01 2.53e-02 1.67e-16 4.79e-01 0s 3 5.91345705e+01 5.60648713e+01 3.02e-14 1.11e-16 2.54e-02 0s 4 5.90075695e+01 5.89659467e+01 1.77e-14 2.22e-16 3.44e-04 0s 5 5.90000000e+01 5.89999999e+01 1.22e-14 2.22e-16 8.10e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.90000000e+01 Root relaxation: objective 5.900000e+01, 43 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 59.0000000 59.00000 0.0% - 0s Explored 0 nodes (43 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.900000000000e+01, best bound 5.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 59 Solution: 2 x [4, 14, 15] 8 x [3, 6, 15] 7 x [1, 5, 11] 7 x [7, 15, 17] 11 x [6, 9, 15] 4 x [1, 2, 10] 1 x [5, 6, 15] 13 x [6, 13, 16] 2 x [6, 13, 14] 4 x [8, 12, 15]