Build (method = -2) #dp: 559 Step-3' Graph: 52 vertices and 147 arcs (0.00s) Step-4' Graph: 7 vertices and 57 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 23 rows, 58 columns and 166 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 21 rows, 56 columns, 162 nonzeros Variable types: 0 continuous, 56 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 166.0000000 Optimize a model with 21 rows, 56 columns and 162 nonzeros Presolved: 21 rows, 56 columns, 162 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.900e+01 Factor NZ : 2.310e+02 Factor Ops : 3.311e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.15223529e+02 -5.27690197e+02 6.11e+01 0.00e+00 1.66e+01 0s 1 1.26224439e+02 -1.62803449e+02 3.42e-01 5.55e-16 2.36e+00 0s 2 8.06924114e+01 -1.90791220e+01 1.99e-02 7.77e-16 7.88e-01 0s 3 6.79021492e+01 6.06255784e+01 9.77e-15 2.78e-16 5.68e-02 0s 4 6.66887651e+01 6.64678089e+01 1.90e-14 4.44e-16 1.73e-03 0s 5 6.66666686e+01 6.66666566e+01 1.20e-14 4.73e-16 9.41e-08 0s 6 6.66666667e+01 6.66666667e+01 1.86e-14 5.55e-16 9.41e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 6.66666667e+01 Root relaxation: objective 6.666667e+01, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 66.66667 0 4 166.00000 66.66667 59.8% - 0s H 0 0 67.0000000 66.66667 0.50% - 0s Explored 0 nodes (70 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.700000000000e+01, best bound 6.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 67 Solution: 13 x [1, 4, 13] 15 x [4, 9, 14] 1 x [4, 7, 10] 5 x [4, 7, 15] 2 x [3, 7, 8] 10 x [2, 6, 11] 4 x [5, 6, 13] 2 x [3, 6, 16] 10 x [6, 10, 12] 3 x [3, 5, 11] 1 x [3, 10] 1 x [3, 5, 14]