Build (method = -2) #dp: 67 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 8 rows and 9 columns Presolve time: 0.00s Presolved: 13 rows, 26 columns, 64 nonzeros Variable types: 0 continuous, 26 integer (0 binary) Found heuristic solution: objective 68.0000000 Found heuristic solution: objective 52.0000000 Optimize a model with 13 rows, 26 columns and 64 nonzeros Presolved: 13 rows, 26 columns, 64 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.400e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.55813615e+02 -1.80888129e+02 8.11e+01 2.22e-16 1.45e+01 0s 1 7.51473630e+01 -1.19221844e+01 7.19e+00 3.33e-16 1.98e+00 0s 2 5.79573455e+01 3.70411403e+01 4.46e-02 5.22e-15 3.68e-01 0s 3 4.96404270e+01 4.49374588e+01 1.36e-03 1.78e-15 8.25e-02 0s 4 4.90712526e+01 4.88260183e+01 3.20e-05 1.11e-16 4.30e-03 0s 5 4.90004173e+01 4.89998807e+01 5.85e-09 7.96e-17 9.41e-06 0s 6 4.90000000e+01 4.90000000e+01 1.07e-14 1.11e-16 1.02e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.90000000e+01 Root relaxation: objective 4.900000e+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 49.0000000 49.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.900000000000e+01, best bound 4.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 49 Solution: 5 x [1, 7] 10 x [1, 9] 1 x [2, 6] 3 x [3, 7] 19 x [3, 8] 6 x [4, 5] 1 x [5, 7] 2 x [5, 10] 2 x [6, 9, 10]