Build (method = -2) #dp: 43 Step-3' Graph: 16 vertices and 41 arcs (0.00s) Step-4' Graph: 7 vertices and 23 arcs (0.00s) #V4/#V3 = 0.44 #A4/#A3 = 0.56 Ready! (0.00s) Optimize a model with 17 rows, 24 columns and 62 nonzeros Presolve removed 12 rows and 15 columns Presolve time: 0.00s Presolved: 5 rows, 9 columns, 22 nonzeros Variable types: 0 continuous, 9 integer (0 binary) Found heuristic solution: objective 74.0000000 Found heuristic solution: objective 70.0000000 Found heuristic solution: objective 69.0000000 Optimize a model with 5 rows, 9 columns and 22 nonzeros Presolved: 5 rows, 9 columns, 22 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.000e+01 Factor NZ : 1.500e+01 Factor Ops : 5.500e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.03361747e+01 1.75817358e+01 8.93e+00 2.22e-16 5.70e+00 0s 1 7.07463826e+01 5.46546566e+01 2.29e-02 1.67e-16 8.12e-01 0s 2 6.56337005e+01 6.48826907e+01 6.16e-04 1.11e-16 3.75e-02 0s 3 6.55006550e+01 6.54993752e+01 3.11e-15 1.11e-16 6.40e-05 0s 4 6.55000007e+01 6.54999994e+01 7.11e-15 1.24e-16 6.40e-08 0s 5 6.55000000e+01 6.55000000e+01 3.55e-15 1.11e-16 6.40e-14 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.55000000e+01 Root relaxation: objective 6.550000e+01, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 65.50000 0 3 69.00000 65.50000 5.07% - 0s H 0 0 66.0000000 65.50000 0.76% - 0s Explored 0 nodes (5 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.600000000000e+01, best bound 6.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 66 Solution: 4 x [1, 10] 11 x [2] 14 x [3] 1 x [4, 10] 13 x [5] 10 x [6, 7] 6 x [7, 9, 10] 6 x [8, 9] 1 x [9, 10]