Build (method = -2) #dp: 179 Step-3' Graph: 35 vertices and 98 arcs (0.00s) Step-4' Graph: 30 vertices and 88 arcs (0.00s) #V4/#V3 = 0.86 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 40 rows, 89 columns and 211 nonzeros Presolve removed 16 rows and 33 columns Presolve time: 0.00s Presolved: 24 rows, 56 columns, 165 nonzeros Variable types: 0 continuous, 56 integer (0 binary) Found heuristic solution: objective 216.0000000 Optimize a model with 24 rows, 56 columns and 165 nonzeros Presolved: 24 rows, 56 columns, 165 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.200e+02 Factor NZ : 2.500e+02 Factor Ops : 3.200e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.01781096e+03 -4.44074838e+03 2.82e+03 1.11e-16 1.56e+02 0s 1 4.62659015e+02 -1.45207231e+03 3.42e+02 4.44e-16 2.55e+01 0s 2 2.26778346e+02 -2.42415610e+02 2.79e-01 5.00e-16 3.92e+00 0s 3 1.61206949e+02 1.12557074e+02 7.82e-03 2.64e-16 4.05e-01 0s 4 1.56800854e+02 1.51862453e+02 6.14e-13 3.33e-16 4.12e-02 0s 5 1.55003618e+02 1.54975929e+02 1.01e-12 3.33e-16 2.31e-04 0s 6 1.55000000e+02 1.55000000e+02 1.63e-12 2.22e-16 2.44e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 1.55000000e+02 Root relaxation: objective 1.550000e+02, 32 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 155.0000000 155.00000 0.0% - 0s Explored 0 nodes (32 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.550000000000e+02, best bound 1.550000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 155 Solution: 43 x [1, 2, 3, 4, 5, 8, 9, 10] 3 x [1, 2, 3, 5, 6, 9] 4 x [1, 3, 4, 5, 9] 5 x [1, 3, 4, 6, 9] 6 x [1, 3, 5, 6, 9] 10 x [1, 4, 5, 6, 9, 10] 4 x [1, 5, 6, 8, 9] 2 x [1, 5, 6, 9] 9 x [2, 4, 5, 6, 7, 8, 9] 21 x [2, 4, 6, 8, 9, 10] 9 x [3, 4, 5, 6, 9, 10] 38 x [3, 4, 6, 8, 9, 10] 1 x [4, 5, 6, 9]