Build (method = -2) #dp: 4483 Step-3' Graph: 107 vertices and 310 arcs (0.02s) Step-4' Graph: 22 vertices and 140 arcs (0.02s) #V4/#V3 = 0.21 #A4/#A3 = 0.45 Ready! (0.02s) Optimize a model with 40 rows, 141 columns and 387 nonzeros Presolve removed 10 rows and 18 columns Presolve time: 0.00s Presolved: 30 rows, 123 columns, 352 nonzeros Variable types: 0 continuous, 123 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 128.0000000 Optimize a model with 30 rows, 123 columns and 352 nonzeros Presolved: 30 rows, 123 columns, 352 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.360e+02 Factor NZ : 3.420e+02 Factor Ops : 5.198e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.01248974e+02 -1.21529379e+03 2.36e+02 2.22e-16 2.20e+01 0s 1 1.32370577e+02 -5.31016094e+02 1.67e+00 1.61e-15 2.68e+00 0s 2 8.60520833e+01 -1.01838091e+02 2.64e-02 7.77e-16 7.25e-01 0s 3 4.61642334e+01 1.50626865e+01 1.18e-04 1.11e-15 1.18e-01 0s 4 4.03654659e+01 3.44956066e+01 1.80e-05 1.02e-15 2.22e-02 0s 5 4.00140233e+01 3.99511217e+01 3.00e-14 1.05e-15 2.38e-04 0s 6 4.00000001e+01 3.99999994e+01 2.26e-14 8.07e-16 2.58e-09 0s 7 4.00000000e+01 4.00000000e+01 3.45e-14 7.52e-16 5.36e-15 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 104 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (104 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.00 seconds Total run time: 0.03 seconds Objective: 40 Solution: 11 x [7, 8, 9, 14, 16] 5 x [2, 7, 12, 12, 16] 2 x [6, 10, 13, 14, 16] 9 x [2, 5, 6, 16, 18] 1 x [9, 14, 15, 18, 18] 3 x [3, 12, 13, 15, 18] 6 x [5, 10, 11, 16, 17] 3 x [1, 4, 12, 13, 18]