Build (method = -2) #dp: 8115 Step-3' Graph: 314 vertices and 3506 arcs (0.05s) Step-4' Graph: 202 vertices and 3233 arcs (0.05s) #V4/#V3 = 0.64 #A4/#A3 = 0.92 Ready! (0.05s) Optimize a model with 246 rows, 3234 columns and 9305 nonzeros Presolve removed 7 rows and 10 columns Presolve time: 0.04s Presolved: 239 rows, 3224 columns, 9297 nonzeros Variable types: 0 continuous, 3224 integer (624 binary) Found heuristic solution: objective 82.0000000 Optimize a model with 239 rows, 3224 columns and 9297 nonzeros Presolved: 239 rows, 3224 columns, 9297 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.079e+03 Factor NZ : 1.268e+04 (roughly 1 MByte of memory) Factor Ops : 8.850e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.25186827e+03 -5.50337040e+04 5.11e+04 1.45e-01 9.42e+01 0s 1 1.71020387e+03 -1.53861226e+04 8.34e+03 2.22e-15 1.59e+01 0s 2 4.41408189e+02 -6.30618460e+03 8.25e+02 1.33e-15 2.24e+00 0s 3 2.53694679e+02 -1.55856307e+03 1.44e+02 6.88e-15 4.24e-01 0s 4 1.25899267e+02 -2.78795838e+02 2.55e+01 2.00e-15 8.02e-02 0s 5 1.10304002e+02 -1.26719046e+02 1.36e+01 1.38e-15 4.31e-02 0s 6 1.00175778e+02 -1.15203871e+02 1.01e+01 1.71e-15 3.80e-02 0s 7 9.28048715e+01 -1.01747434e+02 8.39e+00 1.85e-15 3.38e-02 0s 8 7.36947462e+01 -5.27644988e+01 5.26e+00 1.76e-15 2.15e-02 0s 9 4.67509152e+01 -2.25635957e+01 2.57e+00 1.35e-15 1.16e-02 0s 10 3.07923256e+01 -1.11321680e+01 1.31e+00 2.00e-15 6.84e-03 0s 11 2.75462838e+01 -7.46055717e+00 9.38e-01 1.78e-15 5.65e-03 0s 12 2.68545057e+01 6.13383250e+00 5.17e-01 1.55e-15 3.28e-03 0s 13 2.49784213e+01 1.49213782e+01 3.17e-01 1.59e-15 1.58e-03 0s 14 2.30452418e+01 1.82490395e+01 1.18e-01 2.22e-15 7.49e-04 0s 15 2.19912484e+01 2.01880854e+01 3.06e-02 1.20e-15 2.80e-04 0s 16 2.15014363e+01 2.11250005e+01 5.17e-04 1.11e-15 5.81e-05 0s 17 2.14260801e+01 2.13396542e+01 6.25e-05 1.36e-15 1.33e-05 0s 18 2.14077233e+01 2.13988435e+01 4.35e-06 1.33e-15 1.37e-06 0s 19 2.14054843e+01 2.14053890e+01 1.14e-14 1.55e-15 1.47e-08 0s 20 2.14054545e+01 2.14054545e+01 5.46e-14 1.44e-15 1.67e-14 0s Barrier solved model in 20 iterations and 0.05 seconds Optimal objective 2.14054545e+01 Root relaxation: objective 2.140545e+01, 1205 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.40545 0 67 82.00000 21.40545 73.9% - 0s H 0 0 23.0000000 21.40545 6.93% - 0s H 0 0 22.0000000 21.40545 2.70% - 0s Explored 0 nodes (3183 simplex iterations) in 0.44 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.44 seconds Total run time: 0.51 seconds Objective: 22 Solution: 1 x [22, 29, 36, 43, 44] 1 x [34, 34, 39, 42, 44] 1 x [29, 29, 33, 36, 44] 1 x [30, 31, 37, 42, 43] 2 x [26, 32, 35, 41, 43] 1 x [27, 32, 39, 41, 42] 1 x [38, 38, 39, 40, 41] 1 x [29, 35, 36, 38, 39] 1 x [1, 1, 1, 17, 39] 1 x [3, 6, 10, 11, 22, 37] 1 x [1, 5, 6, 16, 28, 29] 1 x [2, 11, 13, 14, 20, 27] 1 x [3, 4, 5, 24, 25, 25] 1 x [2, 6, 19, 25, 25] 1 x [2, 12, 13, 18, 20, 23] 1 x [7, 8, 15, 17, 17, 23] 1 x [2, 10, 16, 16, 23] 1 x [2, 10, 13, 19, 22, 22] 1 x [2, 11, 14, 20, 20, 21] 1 x [7, 8, 15, 17, 19, 21] 1 x [9, 15, 15, 15, 15, 16]