Build (method = -2) #dp: 87 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 16 vertices and 43 arcs (0.00s) #V4/#V3 = 0.89 #A4/#A3 = 0.91 Ready! (0.00s) Optimize a model with 25 rows, 44 columns and 104 nonzeros Presolve removed 11 rows and 20 columns Presolve time: 0.00s Presolved: 14 rows, 24 columns, 67 nonzeros Variable types: 0 continuous, 24 integer (0 binary) Found heuristic solution: objective 278.0000000 Found heuristic solution: objective 187.0000000 Optimize a model with 14 rows, 24 columns and 67 nonzeros Presolved: 14 rows, 24 columns, 67 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.000e+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 5.50840955e+02 -1.44621717e+03 7.24e+02 0.00e+00 1.28e+02 0s 1 2.66755790e+02 -3.94699937e+02 7.92e+01 5.00e-16 1.86e+01 0s 2 2.02972741e+02 1.06888215e+02 4.26e-14 9.44e-16 1.78e+00 0s 3 1.98120378e+02 1.27743939e+02 1.14e-13 6.59e-16 1.30e+00 0s 4 1.84998153e+02 1.46884152e+02 2.84e-13 1.37e-16 7.06e-01 0s 5 1.73720565e+02 1.69228994e+02 1.42e-13 2.76e-16 8.32e-02 0s 6 1.73002170e+02 1.72982489e+02 1.52e-12 1.70e-16 3.64e-04 0s 7 1.73000000e+02 1.73000000e+02 5.65e-11 2.55e-16 8.76e-10 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.73000000e+02 Root relaxation: objective 1.730000e+02, 14 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 173.0000000 173.00000 0.0% - 0s Explored 0 nodes (14 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.730000000000e+02, best bound 1.730000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 173 Solution: 27 x [1, 2, 3, 4, 5, 7, 8] 8 x [1, 2, 3, 4, 7, 8] 77 x [1, 2, 4, 5, 7, 8] 14 x [1, 3, 4, 6, 7, 8, 9] 12 x [1, 4, 6, 7, 8, 9] 13 x [1, 4, 6, 7, 9] 9 x [1, 4, 6, 9] 7 x [1, 4, 9] 3 x [4] 3 x [4, 9]