Build (method = -2) #dp: 12652 Step-3' Graph: 330 vertices and 1379 arcs (0.10s) Step-4' Graph: 183 vertices and 1092 arcs (0.10s) #V4/#V3 = 0.55 #A4/#A3 = 0.79 Ready! (0.10s) Optimize a model with 215 rows, 1093 columns and 2910 nonzeros Presolve removed 31 rows and 54 columns Presolve time: 0.01s Presolved: 184 rows, 1039 columns, 2837 nonzeros Variable types: 0 continuous, 1039 integer (432 binary) Found heuristic solution: objective 27.0000000 Optimize a model with 184 rows, 1039 columns and 2837 nonzeros Presolved: 184 rows, 1039 columns, 2837 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.806e+03 Factor NZ : 4.869e+03 Factor Ops : 1.678e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.13482816e+03 -8.57070784e+03 1.02e+04 2.16e-01 4.89e+01 0s 1 4.95297810e+02 -3.03518781e+03 2.15e+03 7.77e-16 1.02e+01 0s 2 8.33875922e+01 -1.18182321e+03 1.72e+02 7.77e-16 1.22e+00 0s 3 4.74995195e+01 -2.80122737e+02 2.77e+01 8.88e-16 2.27e-01 0s 4 2.98110085e+01 -8.49897836e+01 6.00e+00 7.77e-16 6.61e-02 0s 5 2.10612582e+01 -4.29876479e+01 2.37e+00 5.17e-16 3.41e-02 0s 6 1.12226133e+01 -1.27220133e+01 7.22e-01 6.11e-16 1.21e-02 0s 7 8.10953542e+00 -2.29109704e+00 4.06e-01 6.64e-16 5.19e-03 0s 8 6.92815509e+00 2.89766020e+00 1.90e-01 4.97e-16 1.99e-03 0s 9 6.35164447e+00 5.46169218e+00 3.18e-02 4.61e-16 4.31e-04 0s 10 6.25128799e+00 6.24753096e+00 1.35e-14 6.66e-16 1.80e-06 0s 11 6.25000129e+00 6.24999753e+00 5.36e-14 4.44e-16 1.80e-09 0s 12 6.25000000e+00 6.25000000e+00 6.89e-14 5.79e-16 1.80e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 6.25000000e+00 Root relaxation: objective 6.250000e+00, 731 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 6.25000 0 21 27.00000 6.25000 76.9% - 0s H 0 0 8.0000000 6.25000 21.9% - 0s H 0 0 7.0000000 6.25000 10.7% - 0s Explored 0 nodes (1081 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.08 seconds Total run time: 0.19 seconds Objective: 7 Solution: 1 x [5, 10, 11, 15, 20, 23, 25] 1 x [5, 5, 10, 11, 15, 20, 23, 25] 1 x [4, 6, 8, 14, 19, 27] 1 x [1, 2, 3, 7, 17, 22, 30, 31] 1 x [8, 18, 24, 25, 28, 30, 30, 32] 1 x [10, 11, 16, 21, 29] 1 x [9, 12, 13, 13, 16, 25, 26, 26]