Build (method = -2) #dp: 2336 Step-3' Graph: 112 vertices and 1080 arcs (0.01s) Step-4' Graph: 110 vertices and 1076 arcs (0.01s) #V4/#V3 = 0.98 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 147 rows, 1077 columns and 3015 nonzeros Presolve removed 28 rows and 32 columns Presolve time: 0.03s Presolved: 119 rows, 1045 columns, 3000 nonzeros Variable types: 0 continuous, 1045 integer (575 binary) Found heuristic solution: objective 27.0000000 Optimize a model with 119 rows, 1045 columns and 3000 nonzeros Presolved: 119 rows, 1045 columns, 3000 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.189e+03 Factor NZ : 4.839e+03 Factor Ops : 2.656e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.17349845e+03 -3.49207163e+03 3.69e+03 2.64e-01 1.95e+01 0s 1 3.12700910e+02 -1.55248787e+03 9.07e+02 5.55e-16 4.89e+00 0s 2 8.65997478e+01 -5.73091119e+02 8.00e+01 9.99e-16 6.30e-01 0s 3 3.76219463e+01 -6.97176340e+01 4.33e+00 4.44e-16 6.30e-02 0s 4 2.69057000e+01 -1.24028896e+01 1.50e+00 3.33e-16 2.13e-02 0s 5 2.11650476e+01 2.64121938e+00 5.61e-01 2.22e-16 9.43e-03 0s 6 1.93009067e+01 7.83713520e+00 3.47e-01 2.22e-16 5.75e-03 0s 7 1.75530973e+01 1.25011999e+01 1.90e-01 2.22e-16 2.51e-03 0s 8 1.67328424e+01 1.41703098e+01 1.03e-01 2.22e-16 1.26e-03 0s 9 1.62342051e+01 1.51418790e+01 3.46e-02 2.22e-16 5.30e-04 0s 10 1.61078908e+01 1.55319462e+01 2.13e-02 2.22e-16 2.79e-04 0s 11 1.60271405e+01 1.56729315e+01 1.40e-02 2.22e-16 1.71e-04 0s 12 1.59472569e+01 1.57335599e+01 7.21e-03 2.22e-16 1.03e-04 0s 13 1.59150422e+01 1.57870760e+01 4.36e-03 2.22e-16 6.16e-05 0s 14 1.58927875e+01 1.58478431e+01 2.21e-03 2.22e-16 2.17e-05 0s 15 1.58798637e+01 1.58636533e+01 7.22e-04 4.44e-16 7.80e-06 0s 16 1.58733735e+01 1.58729633e+01 8.31e-13 2.22e-16 1.95e-07 0s 17 1.58733333e+01 1.58733333e+01 4.83e-13 2.22e-16 4.78e-12 0s Barrier solved model in 17 iterations and 0.01 seconds Optimal objective 1.58733333e+01 Root relaxation: objective 1.587333e+01, 726 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 15.87333 0 37 27.00000 15.87333 41.2% - 0s H 0 0 17.0000000 15.87333 6.63% - 0s H 0 0 16.0000000 15.87333 0.79% - 0s Explored 0 nodes (1524 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+01, best bound 1.600000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.11 seconds Total run time: 0.13 seconds Objective: 16 Solution: 1 x [3, 18, 37] 1 x [7, 14, 37] 1 x [20, 36] 1 x [12, 13, 35] 1 x [10, 16, 34] 1 x [24, 33] 1 x [11, 15, 32] 1 x [25, 31] 1 x [10, 18, 30] 1 x [5, 24, 29] 1 x [2, 4, 23, 28] 1 x [1, 6, 9, 17, 28] 1 x [7, 22, 27] 1 x [8, 22, 26] 1 x [15, 19, 24] 1 x [2, 3, 13, 15, 21]