Build (method = -2) #dp: 65 Step-3' Graph: 19 vertices and 50 arcs (0.00s) Step-4' Graph: 11 vertices and 34 arcs (0.00s) #V4/#V3 = 0.58 #A4/#A3 = 0.68 Ready! (0.00s) Optimize a model with 21 rows, 35 columns and 87 nonzeros Presolve removed 9 rows and 9 columns Presolve time: 0.00s Presolved: 12 rows, 26 columns, 63 nonzeros Variable types: 0 continuous, 26 integer (1 binary) Found heuristic solution: objective 81.0000000 Found heuristic solution: objective 63.0000000 Optimize a model with 12 rows, 26 columns and 63 nonzeros Presolved: 12 rows, 26 columns, 63 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.400e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.08968344e+02 -3.64511690e+02 1.90e+02 5.55e-17 2.31e+01 0s 1 9.34909966e+01 -5.46407955e+01 8.67e+00 6.11e-16 2.99e+00 0s 2 6.15844409e+01 2.89734258e+01 1.95e-01 3.26e-16 5.95e-01 0s 3 4.95628208e+01 4.56171933e+01 2.19e-02 3.05e-16 7.19e-02 0s 4 4.80829859e+01 4.78752265e+01 6.30e-04 3.33e-16 3.78e-03 0s 5 4.80001040e+01 4.79999167e+01 2.52e-07 3.33e-16 3.41e-06 0s 6 4.80000000e+01 4.80000000e+01 2.49e-13 3.33e-16 3.41e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.80000000e+01 Root relaxation: objective 4.800000e+01, 8 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 48.0000000 48.00000 0.0% - 0s Explored 0 nodes (8 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.800000000000e+01, best bound 4.800000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 48 Solution: 4 x [1] 1 x [1, 9] 7 x [1, 10] 5 x [2, 7] 13 x [3, 6] 1 x [3, 7] 3 x [3, 8] 6 x [4, 7] 3 x [5, 6, 8] 5 x [6, 7, 8]