Build (method = -2) #dp: 7766 Step-3' Graph: 106 vertices and 307 arcs (0.04s) Step-4' Graph: 11 vertices and 117 arcs (0.04s) #V4/#V3 = 0.10 #A4/#A3 = 0.38 Ready! (0.04s) Optimize a model with 31 rows, 118 columns and 340 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 27 rows, 112 columns, 328 nonzeros Variable types: 0 continuous, 112 integer (10 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 149.0000000 Optimize a model with 27 rows, 112 columns and 328 nonzeros Presolved: 27 rows, 112 columns, 328 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.180e+02 Factor NZ : 3.780e+02 Factor Ops : 6.930e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.01146485e+03 -1.27139287e+03 2.34e+02 3.95e-02 3.75e+01 0s 1 2.04597050e+02 -6.83221483e+02 1.36e+01 7.55e-15 5.06e+00 0s 2 9.61099522e+01 -4.19768082e+01 1.21e-03 2.61e-15 5.77e-01 0s 3 4.31811710e+01 2.42998558e+01 9.93e-05 2.66e-15 7.80e-02 0s 4 4.03641856e+01 3.94801123e+01 1.07e-05 3.44e-15 3.65e-03 0s 5 4.00005859e+01 3.99970442e+01 2.47e-14 2.86e-15 1.46e-05 0s 6 4.00000000e+01 4.00000000e+01 2.95e-14 2.44e-15 1.59e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 97 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 (97 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.04 seconds Gurobi run time: 0.00 seconds Total run time: 0.05 seconds Objective: 40 Solution: 5 x [2, 11, 13, 13, 16] 3 x [2, 6, 9, 11, 19] 2 x [3, 5, 13, 19, 19] 2 x [4, 7, 13, 13, 14] 11 x [5, 7, 10, 12, 15] 9 x [3, 4, 8, 14, 18] 5 x [1, 3, 16, 18, 19] 1 x [4, 12, 17, 19, 19] 1 x [6, 10, 11, 12, 19] 1 x [6, 10, 18, 19, 20]