Build (method = -2) #dp: 24618 Step-3' Graph: 355 vertices and 1476 arcs (0.15s) Step-4' Graph: 231 vertices and 1230 arcs (0.15s) #V4/#V3 = 0.65 #A4/#A3 = 0.83 Ready! (0.15s) Optimize a model with 249 rows, 1231 columns and 3240 nonzeros Presolve removed 44 rows and 90 columns Presolve time: 0.01s Presolved: 205 rows, 1141 columns, 3092 nonzeros Variable types: 0 continuous, 1141 integer (0 binary) Found heuristic solution: objective 184.0000000 Optimize a model with 205 rows, 1141 columns and 3092 nonzeros Presolved: 205 rows, 1141 columns, 3092 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.726e+03 Factor NZ : 5.015e+03 Factor Ops : 1.390e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.39341682e+03 -2.60570029e+04 2.77e+04 2.22e-16 9.36e+01 0s 1 5.75594705e+02 -1.08955978e+04 4.02e+03 6.66e-16 1.55e+01 0s 2 2.73228357e+02 -3.98122098e+03 9.43e+02 6.66e-16 3.86e+00 0s 3 1.95709321e+02 -1.51227475e+03 1.15e+02 1.22e-15 9.26e-01 0s 4 1.38141312e+02 -4.10048900e+02 1.56e-13 6.11e-16 2.38e-01 0s 5 1.00903192e+02 -2.93461889e+02 1.03e-13 6.66e-16 1.71e-01 0s 6 6.47394501e+01 -1.54006788e+02 1.74e-13 2.84e-16 9.51e-02 0s 7 3.98941579e+01 -3.92807960e+01 2.10e-13 3.33e-16 3.44e-02 0s 8 3.22656330e+01 -1.31852910e+00 7.58e-14 1.95e-16 1.46e-02 0s 9 2.77157971e+01 6.38444121e+00 4.45e-14 2.05e-16 9.27e-03 0s 10 2.66499739e+01 2.15159643e+01 4.66e-14 2.22e-16 2.23e-03 0s 11 2.51212456e+01 2.47904960e+01 2.59e-13 3.33e-16 1.44e-04 0s 12 2.50001461e+01 2.49996282e+01 3.63e-14 2.22e-16 2.25e-07 0s 13 2.50000000e+01 2.50000000e+01 1.14e-13 2.22e-16 2.27e-13 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 773 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 33 184.00000 25.00000 86.4% - 0s H 0 0 31.0000000 25.00000 19.4% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s 0 0 25.00000 0 69 26.00000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Cutting planes: Gomory: 1 MIR: 2 Explored 0 nodes (1105 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.16 seconds Gurobi run time: 0.12 seconds Total run time: 0.28 seconds Objective: 25 Solution: 10 x [6, 7, 8, 12, 14, 16, 16, 18] 1 x [7, 11, 11, 11, 11, 11, 11, 12] 4 x [2, 7, 9, 9, 9, 10, 16, 18] 1 x [3, 3, 3, 5, 7, 8, 12, 13] 1 x [2, 5, 6, 12, 13, 15, 16, 16] 2 x [5, 5, 10, 12, 13, 14, 16, 17] 1 x [2, 5, 12, 13, 13, 14, 14, 17] 3 x [1, 2, 2, 4, 15, 16, 17, 18] 2 x [2, 5, 5, 5, 5, 10, 13, 16]