Build (method = -2) #dp: 1239 Step-3' Graph: 65 vertices and 182 arcs (0.01s) Step-4' Graph: 9 vertices and 70 arcs (0.01s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.01s) Optimize a model with 18 rows, 71 columns and 205 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 16 rows, 69 columns, 201 nonzeros Variable types: 0 continuous, 69 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 894.0000000 Optimize a model with 16 rows, 69 columns and 201 nonzeros Presolved: 16 rows, 69 columns, 201 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.400e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.59138431e+03 -9.20499413e+03 1.58e+03 1.11e-16 2.86e+02 0s 1 6.54425295e+02 -3.93831240e+03 6.82e-13 4.44e-16 3.21e+01 0s 2 4.37236893e+02 -1.50362458e+02 2.27e-13 3.33e-16 4.05e+00 0s 3 1.55002360e+02 4.39120407e+01 9.24e-14 1.11e-16 7.56e-01 0s 4 1.46294658e+02 1.41666823e+02 8.22e-13 3.33e-16 3.15e-02 0s 5 1.42857668e+02 1.42856501e+02 1.61e-13 2.38e-16 7.94e-06 0s 6 1.42857143e+02 1.42857143e+02 5.11e-14 2.22e-16 8.23e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 57 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 142.85714 0 11 894.00000 142.85714 84.0% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Explored 0 nodes (61 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.430000000000e+02, best bound 1.430000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 143 Solution: 14 x [1, 2, 3, 6, 7, 8, 8] 66 x [2, 3, 4, 4, 5, 6, 9] 1 x [2, 3, 5, 6, 6, 8, 9] 7 x [1, 2, 4, 6, 6, 8, 8] 1 x [2, 4, 5, 6, 6, 9] 4 x [3, 4, 5, 6, 6, 8, 9] 50 x [1, 3, 4, 4, 7, 8, 9]