Build (method = -2) #dp: 113 Step-3' Graph: 22 vertices and 59 arcs (0.00s) Step-4' Graph: 19 vertices and 53 arcs (0.00s) #V4/#V3 = 0.86 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 29 rows, 54 columns and 128 nonzeros Presolve removed 10 rows and 18 columns Presolve time: 0.00s Presolved: 19 rows, 36 columns, 94 nonzeros Variable types: 0 continuous, 36 integer (0 binary) Found heuristic solution: objective 274.0000000 Optimize a model with 19 rows, 36 columns and 94 nonzeros Presolved: 19 rows, 36 columns, 94 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.200e+01 Factor NZ : 1.900e+02 Factor Ops : 2.470e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.32141277e+02 -4.64596902e+03 2.22e+03 2.22e-16 1.93e+02 0s 1 4.41227047e+02 -1.27489045e+03 3.21e+02 2.78e-16 3.28e+01 0s 2 2.52273441e+02 -1.91762202e+02 2.66e-01 3.89e-16 5.56e+00 0s 3 1.57164739e+02 1.08700665e+02 6.07e-03 1.39e-16 6.06e-01 0s 4 1.46075594e+02 1.38968109e+02 9.52e-04 2.22e-16 8.88e-02 0s 5 1.45098795e+02 1.44883077e+02 3.99e-12 6.39e-17 2.70e-03 0s 6 1.45000002e+02 1.44999996e+02 3.90e-12 2.22e-16 7.10e-08 0s 7 1.45000000e+02 1.45000000e+02 9.09e-13 2.22e-16 7.53e-14 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.45000000e+02 Root relaxation: objective 1.450000e+02, 27 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 145.0000000 145.00000 0.0% - 0s Explored 0 nodes (27 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.450000000000e+02, best bound 1.450000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 145 Solution: 19 x [1, 2, 3, 4, 5, 6, 9, 10] 24 x [1, 2, 3, 4, 5, 7, 9, 10] 2 x [1, 2, 3, 4, 5, 9, 10] 39 x [1, 2, 3, 5, 6, 7, 9] 27 x [1, 2, 4, 5, 6, 7, 9] 9 x [1, 2, 5, 8, 9] 8 x [1, 2, 6, 10] 1 x [1, 2, 8, 9] 10 x [2, 3, 4, 5, 6, 8, 9] 3 x [2, 4, 5, 6, 8, 9] 1 x [2, 5, 6, 8, 9] 2 x [2, 6, 10]