Build (method = -2) #dp: 15570 Step-3' Graph: 692 vertices and 4147 arcs (0.09s) Step-4' Graph: 631 vertices and 4028 arcs (0.10s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.10s) Optimize a model with 648 rows, 4029 columns and 10833 nonzeros Presolve removed 57 rows and 108 columns Presolve time: 0.04s Presolved: 591 rows, 3921 columns, 10754 nonzeros Variable types: 0 continuous, 3921 integer (0 binary) Found heuristic solution: objective 166.0000000 Optimize a model with 591 rows, 3921 columns and 10754 nonzeros Presolved: 591 rows, 3921 columns, 10754 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.642e+03 Factor NZ : 3.010e+04 (roughly 2 MBytes of memory) Factor Ops : 2.207e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.18379801e+03 -1.34598536e+05 1.51e+05 2.22e-16 2.17e+02 0s 1 9.56288439e+02 -7.45533086e+04 1.97e+04 6.66e-16 3.35e+01 0s 2 5.05183413e+02 -3.31730717e+04 6.76e+03 6.22e-15 1.14e+01 0s 3 2.58841330e+02 -1.42909311e+04 1.25e+03 1.78e-15 3.03e+00 0s 4 2.09289006e+02 -6.11424512e+03 2.11e+02 2.66e-15 9.76e-01 0s 5 2.01160872e+02 -1.96715379e+03 4.55e+01 1.11e-15 3.01e-01 0s 6 1.97552564e+02 -7.03271843e+02 2.07e-01 6.94e-16 1.15e-01 0s 7 1.82156129e+02 -6.78870013e+02 1.56e-01 7.25e-16 1.10e-01 0s 8 1.51876242e+02 -5.23739803e+02 1.08e-01 6.66e-16 8.60e-02 0s 9 1.00608006e+02 -2.24536846e+02 6.51e-02 3.82e-16 4.14e-02 0s 10 7.49324335e+01 -1.00957747e+02 4.43e-02 4.44e-16 2.24e-02 0s 11 5.06824737e+01 -4.00651842e+01 2.81e-02 3.25e-16 1.16e-02 0s 12 4.07517394e+01 -1.93060397e+01 2.08e-02 3.37e-16 7.65e-03 0s 13 3.41327628e+01 -5.93813307e+00 1.33e-02 3.58e-16 5.10e-03 0s 14 3.17903570e+01 6.04899047e+00 9.12e-03 3.33e-16 3.28e-03 0s 15 2.98707203e+01 1.78178346e+01 4.36e-03 3.53e-16 1.53e-03 0s 16 2.83925096e+01 2.39021947e+01 1.78e-03 2.85e-16 5.71e-04 0s 17 2.73817557e+01 2.47635801e+01 7.22e-04 3.15e-16 3.33e-04 0s 18 2.70146197e+01 2.57028794e+01 3.31e-04 2.98e-16 1.67e-04 0s 19 2.68495862e+01 2.62274943e+01 1.68e-04 3.01e-16 7.92e-05 0s 20 2.67440317e+01 2.64198792e+01 7.80e-05 3.10e-16 4.12e-05 0s 21 2.66953100e+01 2.65208893e+01 4.04e-05 2.74e-16 2.22e-05 0s 22 2.66518563e+01 2.65973487e+01 9.72e-06 3.33e-16 6.94e-06 0s 23 2.66432920e+01 2.66223848e+01 4.98e-06 3.33e-16 2.66e-06 0s 24 2.66356325e+01 2.66313528e+01 7.75e-07 3.81e-16 5.45e-07 0s 25 2.66340142e+01 2.66339703e+01 4.98e-09 3.33e-16 5.59e-09 0s 26 2.66340000e+01 2.66340000e+01 7.45e-14 4.44e-16 9.21e-15 0s Barrier solved model in 26 iterations and 0.11 seconds Optimal objective 2.66340000e+01 Root relaxation: objective 2.663400e+01, 1296 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 26.63400 0 55 166.00000 26.63400 84.0% - 0s H 0 0 29.0000000 26.63400 8.16% - 0s H 0 0 27.0000000 26.63400 1.36% - 0s Explored 0 nodes (2964 simplex iterations) in 0.55 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.700000000000e+01, best bound 2.700000000000e+01, gap 0.0% Preprocessing time: 0.12 seconds Gurobi run time: 0.55 seconds Total run time: 0.66 seconds Objective: 27 Solution: 1 x [4, 4, 5, 7, 12, 13, 15, 17] 2 x [3, 6, 6, 11, 13, 15] 3 x [1, 2, 5, 6, 13, 14, 15, 16] 3 x [1, 2, 4, 6, 8, 9, 13, 15] 3 x [1, 2, 5, 6, 6, 7, 13, 15] 1 x [3, 4, 4, 7, 10, 11, 12, 15] 2 x [2, 3, 3, 11, 12, 13] 1 x [4, 4, 7, 12, 12, 12, 13] 3 x [2, 3, 4, 4, 5, 13, 16, 16] 1 x [2, 3, 3, 11, 12, 17] 1 x [3, 3, 7, 7, 11, 17, 17, 17] 1 x [5, 5, 5, 5, 5, 5, 7, 11] 2 x [7, 11, 11, 17, 17, 17, 17] 1 x [3, 11, 11, 11, 11, 16] 1 x [4, 4, 4, 5, 6, 10, 10, 17] 1 x [16, 16, 16, 16, 16, 16, 16]