Build (method = -2) #dp: 161 Step-3' Graph: 32 vertices and 89 arcs (0.00s) Step-4' Graph: 25 vertices and 75 arcs (0.00s) #V4/#V3 = 0.78 #A4/#A3 = 0.84 Ready! (0.00s) Optimize a model with 35 rows, 76 columns and 182 nonzeros Presolve removed 8 rows and 14 columns Presolve time: 0.00s Presolved: 27 rows, 62 columns, 161 nonzeros Variable types: 0 continuous, 62 integer (0 binary) Optimize a model with 27 rows, 62 columns and 161 nonzeros Presolved: 27 rows, 62 columns, 161 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.140e+02 Factor NZ : 3.270e+02 Factor Ops : 5.145e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.39561004e+02 -2.07100000e+02 1.25e+03 0.00e+00 1.10e+01 0s 1 1.61910420e+02 6.55234691e+00 2.16e+02 9.22e-03 2.14e+00 0s 2 1.42700741e+02 1.17468906e+02 5.23e+01 3.20e-04 3.44e-01 0s 3 1.39521336e+02 1.45215719e+02 2.14e+01 2.22e-16 8.93e-02 0s 4 1.69002519e+02 1.44786185e+02 3.06e+00 3.83e-16 2.22e-01 0s 5 1.62141251e+02 1.58861625e+02 3.08e-01 1.32e-16 3.10e-02 0s 6 1.62005515e+02 1.61999014e+02 2.74e-12 1.72e-16 5.56e-05 0s 7 1.62000000e+02 1.62000000e+02 5.59e-13 2.40e-16 5.60e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.62000000e+02 Root relaxation: objective 1.620000e+02, 24 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 162.0000000 162.00000 0.0% - 0s Explored 0 nodes (24 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.620000000000e+02, best bound 1.620000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 162 Solution: 8 x [1, 2, 3, 5, 6, 8, 9, 10] 1 x [1, 2, 3, 5, 8, 9, 10] 11 x [1, 2, 4, 8, 9] 15 x [1, 2, 5, 7, 8, 9] 30 x [1, 2, 5, 8, 9, 10] 3 x [1, 2, 8, 10] 41 x [1, 3, 4, 5, 6, 8, 9, 10] 9 x [2, 4, 5, 8, 9, 10] 3 x [2, 4, 8, 9, 10] 7 x [2, 4, 8, 10] 1 x [2, 8] 33 x [4, 5, 8, 9, 10]