Build (method = -2) #dp: 85 Step-3' Graph: 23 vertices and 62 arcs (0.00s) Step-4' Graph: 14 vertices and 44 arcs (0.00s) #V4/#V3 = 0.61 #A4/#A3 = 0.71 Ready! (0.00s) Optimize a model with 24 rows, 45 columns and 111 nonzeros Presolve removed 9 rows and 12 columns Presolve time: 0.00s Presolved: 15 rows, 33 columns, 85 nonzeros Variable types: 0 continuous, 33 integer (0 binary) Found heuristic solution: objective 57.0000000 Found heuristic solution: objective 56.0000000 Found heuristic solution: objective 55.0000000 Optimize a model with 15 rows, 33 columns and 85 nonzeros Presolved: 15 rows, 33 columns, 85 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.100e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.56817100e+02 -2.61996640e+02 1.92e+02 2.22e-16 2.18e+01 0s 1 7.58847935e+01 -7.04383851e+01 2.00e+01 3.33e-16 3.21e+00 0s 2 5.65176855e+01 1.82191497e+01 4.90e-02 3.33e-16 5.41e-01 0s 3 5.04878645e+01 3.94274819e+01 1.13e-04 1.11e-16 1.56e-01 0s 4 4.91200379e+01 4.85046464e+01 1.78e-06 4.16e-17 8.67e-03 0s 5 4.90000194e+01 4.89998817e+01 1.30e-09 1.11e-16 1.94e-06 0s 6 4.90000000e+01 4.90000000e+01 9.95e-14 1.11e-16 1.96e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.90000000e+01 Root relaxation: objective 4.900000e+01, 23 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 (23 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: 8 x [1, 9] 2 x [2] 3 x [2, 9] 1 x [2, 10] 12 x [3, 6] 2 x [3, 7] 2 x [3, 9, 10] 2 x [3, 10] 8 x [4, 5] 2 x [5, 8] 3 x [5, 9] 2 x [5, 9, 10] 2 x [5, 10]