Build (method = -2) #dp: 5339 Step-3' Graph: 101 vertices and 292 arcs (0.02s) Step-4' Graph: 20 vertices and 130 arcs (0.03s) #V4/#V3 = 0.20 #A4/#A3 = 0.45 Ready! (0.03s) Optimize a model with 38 rows, 131 columns and 361 nonzeros Presolve removed 9 rows and 15 columns Presolve time: 0.00s Presolved: 29 rows, 116 columns, 332 nonzeros Variable types: 0 continuous, 116 integer (0 binary) Found heuristic solution: objective 200.0000000 Found heuristic solution: objective 160.0000000 Optimize a model with 29 rows, 116 columns and 332 nonzeros Presolved: 29 rows, 116 columns, 332 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.290e+02 Factor NZ : 3.040e+02 Factor Ops : 4.174e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.99222380e+02 -1.19380881e+03 2.51e+02 2.22e-16 2.31e+01 0s 1 1.38026594e+02 -5.09100691e+02 5.00e+00 5.55e-16 2.92e+00 0s 2 8.32682896e+01 -8.28758107e+01 6.22e-02 1.11e-15 6.79e-01 0s 3 4.34837032e+01 2.47529863e+01 2.77e-03 3.33e-16 7.52e-02 0s 4 4.05260060e+01 3.90976673e+01 3.01e-04 3.33e-16 5.74e-03 0s 5 4.00017636e+01 3.99951976e+01 8.74e-07 3.33e-16 2.64e-05 0s 6 4.00000000e+01 4.00000000e+01 8.67e-13 2.18e-16 2.77e-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.03 seconds Gurobi run time: 0.00 seconds Total run time: 0.04 seconds Objective: 40 Solution: 1 x [2, 2, 4, 9, 17] 4 x [8, 12, 14, 15, 16] 3 x [2, 3, 6, 8, 11] 12 x [1, 2, 3, 10, 16] 4 x [2, 2, 9, 12, 18] 7 x [6, 7, 12, 12, 18] 7 x [2, 4, 6, 7, 13] 2 x [1, 2, 5, 6, 6]