Build (method = -2) #dp: 734 Step-3' Graph: 52 vertices and 147 arcs (0.00s) Step-4' Graph: 6 vertices and 55 arcs (0.00s) #V4/#V3 = 0.12 #A4/#A3 = 0.37 Ready! (0.00s) Optimize a model with 23 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 3 columns Presolve time: 0.00s Presolved: 21 rows, 53 columns, 156 nonzeros Variable types: 0 continuous, 53 integer (0 binary) Found heuristic solution: objective 175.0000000 Optimize a model with 21 rows, 53 columns and 156 nonzeros Presolved: 21 rows, 53 columns, 156 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 2.310e+02 Factor Ops : 3.311e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.51207617e+02 -4.89868374e+02 1.43e+01 0.00e+00 1.41e+01 0s 1 1.12485925e+02 -1.32642931e+02 4.43e-01 2.22e-16 2.13e+00 0s 2 7.22261556e+01 1.26239516e+01 2.40e-02 2.22e-16 4.89e-01 0s 3 5.91323537e+01 5.59365938e+01 8.66e-15 2.22e-16 2.60e-02 0s 4 5.90085088e+01 5.89615106e+01 6.23e-14 1.11e-16 3.82e-04 0s 5 5.90000000e+01 5.89999999e+01 3.02e-14 1.11e-16 9.43e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.90000000e+01 Root relaxation: objective 5.900000e+01, 42 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 (42 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 [1, 4, 17] 8 x [3, 5, 15] 3 x [7, 11, 12] 4 x [1, 8, 11] 4 x [1, 14, 17] 1 x [1, 12, 17] 4 x [2, 6, 7] 11 x [6, 9, 16] 2 x [15, 15, 16] 15 x [6, 13, 15] 4 x [6, 10, 15] 1 x [6, 15, 15]