Build (method = -2) #dp: 111 Step-3' Graph: 21 vertices and 56 arcs (0.00s) Step-4' Graph: 19 vertices and 52 arcs (0.00s) #V4/#V3 = 0.90 #A4/#A3 = 0.93 Ready! (0.00s) Optimize a model with 29 rows, 53 columns and 125 nonzeros Presolve removed 15 rows and 28 columns Presolve time: 0.00s Presolved: 14 rows, 25 columns, 71 nonzeros Variable types: 0 continuous, 25 integer (0 binary) Optimize a model with 14 rows, 25 columns and 71 nonzeros Presolved: 14 rows, 25 columns, 71 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.300e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.99671126e+02 -3.19349483e+02 5.72e+02 2.22e-16 5.11e+01 0s 1 2.15278480e+02 -4.70342425e+01 6.13e+01 4.44e-16 7.95e+00 0s 2 1.81537875e+02 1.56941773e+02 8.57e+00 1.11e-16 6.72e-01 0s 3 1.83053025e+02 1.82423551e+02 7.39e-13 4.15e-16 1.37e-02 0s 4 1.83000166e+02 1.82999426e+02 6.59e-12 2.22e-16 1.61e-05 0s 5 1.83000000e+02 1.83000000e+02 1.53e-11 2.93e-16 1.61e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.83000000e+02 Root relaxation: objective 1.830000e+02, 16 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 183.0000000 183.00000 0.0% - 0s Explored 0 nodes (16 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.830000000000e+02, best bound 1.830000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 183 Solution: 17 x [1, 3, 4, 5, 6, 7, 9] 1 x [1, 3, 4, 5, 7, 8, 9] 1 x [1, 3, 5, 7, 8, 9] 47 x [1, 3, 5, 9, 10] 2 x [1, 3, 6, 8] 1 x [1, 3, 6, 10] 9 x [1, 3, 8, 9] 64 x [2, 3, 4, 5, 6, 9] 36 x [3, 5, 6, 9, 10] 1 x [3, 6, 8, 9, 10] 4 x [3, 6, 8, 10]