Build (method = -2) #dp: 22816 Step-3' Graph: 737 vertices and 4506 arcs (0.13s) Step-4' Graph: 680 vertices and 4395 arcs (0.14s) #V4/#V3 = 0.92 #A4/#A3 = 0.98 Ready! (0.14s) Optimize a model with 697 rows, 4396 columns and 11831 nonzeros Presolve removed 84 rows and 162 columns Presolve time: 0.05s Presolved: 613 rows, 4234 columns, 11618 nonzeros Variable types: 0 continuous, 4234 integer (0 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 196.0000000 Optimize a model with 613 rows, 4234 columns and 11618 nonzeros Presolved: 613 rows, 4234 columns, 11618 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 7.236e+03 Factor NZ : 3.708e+04 (roughly 2 MBytes of memory) Factor Ops : 3.259e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.87025850e+03 -2.12570261e+05 1.80e+05 2.22e-16 2.95e+02 0s 1 1.11321698e+03 -1.25684875e+05 2.30e+04 1.22e-15 4.72e+01 0s 2 5.46499917e+02 -5.20513495e+04 7.66e+03 2.22e-15 1.57e+01 0s 3 3.11354339e+02 -2.06861718e+04 2.37e+03 6.22e-15 5.06e+00 0s 4 2.22882749e+02 -1.02956220e+04 5.29e+02 3.55e-15 1.75e+00 0s 5 2.00323309e+02 -4.61780264e+03 7.15e+01 8.88e-15 6.23e-01 0s 6 1.96408145e+02 -1.33630868e+03 2.48e+00 4.22e-15 1.81e-01 0s 7 1.86302429e+02 -7.72131435e+02 1.33e-03 2.33e-15 1.13e-01 0s 8 1.41733198e+02 -6.15354028e+02 8.37e-04 2.11e-15 8.92e-02 0s 9 8.49290141e+01 -3.36301331e+02 4.32e-04 8.88e-16 4.96e-02 0s 10 6.55530434e+01 -1.92181172e+02 3.11e-04 5.55e-16 3.04e-02 0s 11 5.19741213e+01 -4.91224201e+01 2.39e-04 4.15e-16 1.19e-02 0s 12 3.96252460e+01 -2.15014050e+01 1.68e-04 3.24e-16 7.20e-03 0s 13 3.44951836e+01 -2.83394264e+00 1.19e-04 3.01e-16 4.40e-03 0s 14 2.76508193e+01 1.05879932e+01 4.47e-05 3.04e-16 2.01e-03 0s 15 2.56605264e+01 1.82295867e+01 1.94e-05 2.69e-16 8.76e-04 0s 16 2.48776345e+01 2.03588654e+01 1.31e-05 3.27e-16 5.33e-04 0s 17 2.37631526e+01 2.16214898e+01 5.44e-06 3.19e-16 2.52e-04 0s 18 2.33835330e+01 2.21948163e+01 2.82e-06 2.99e-16 1.40e-04 0s 19 2.31789077e+01 2.25623846e+01 1.42e-06 3.05e-16 7.27e-05 0s 20 2.30008118e+01 2.27639724e+01 3.03e-07 2.79e-16 2.79e-05 0s 21 2.29640296e+01 2.28499925e+01 1.43e-07 2.98e-16 1.34e-05 0s 22 2.29494920e+01 2.28875443e+01 8.54e-08 3.33e-16 7.30e-06 0s 23 2.29369574e+01 2.29117838e+01 3.84e-08 2.85e-16 2.97e-06 0s 24 2.29263956e+01 2.29245661e+01 7.69e-10 2.90e-16 2.16e-07 0s 25 2.29260008e+01 2.29259982e+01 2.49e-12 3.22e-16 3.10e-10 0s 26 2.29260000e+01 2.29260000e+01 2.49e-13 2.24e-16 3.10e-13 0s Barrier solved model in 26 iterations and 0.13 seconds Optimal objective 2.29260000e+01 Root relaxation: objective 2.292600e+01, 1617 iterations, 0.16 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.92600 0 82 196.00000 22.92600 88.3% - 0s H 0 0 25.0000000 22.92600 8.30% - 0s H 0 0 23.0000000 22.92600 0.32% - 0s Explored 0 nodes (3250 simplex iterations) in 0.70 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.16 seconds Gurobi run time: 0.70 seconds Total run time: 0.86 seconds Objective: 23 Solution: 1 x [5, 6, 11, 11, 12, 13, 14, 16] 1 x [1, 5, 5, 11, 11, 12, 13, 16, 17] 1 x [5, 5, 9, 11, 11, 12, 14, 15, 16] 1 x [1, 6, 7, 8, 12, 12, 16, 17] 2 x [5, 5, 6, 9, 12, 12, 14, 14, 16] 1 x [4, 4, 4, 5, 13, 13, 14, 16, 17] 2 x [3, 4, 12, 12, 13, 16, 16] 1 x [5, 5, 8, 12, 13, 16, 16, 16, 17] 1 x [7, 12, 12, 12, 14, 14, 14, 14, 14] 3 x [3, 6, 9, 10, 10, 11, 13, 13, 13] 1 x [5, 6, 6, 6, 6, 6, 11, 14] 1 x [7, 8, 10, 11, 11, 11, 11, 17, 17] 1 x [3, 3, 3, 7, 7, 13, 13, 13, 15] 3 x [2, 3, 3, 3, 13, 13, 13, 13, 13] 2 x [1, 7, 8, 8, 8, 8, 8, 9, 13] 1 x [7, 7, 8, 9, 9, 9, 9, 13, 13]