Build (method = -2) #dp: 7375 Step-3' Graph: 500 vertices and 3292 arcs (0.04s) Step-4' Graph: 483 vertices and 3258 arcs (0.05s) #V4/#V3 = 0.97 #A4/#A3 = 0.99 Ready! (0.05s) Optimize a model with 523 rows, 3259 columns and 8824 nonzeros Presolve removed 87 rows and 161 columns Presolve time: 0.06s Presolved: 436 rows, 3098 columns, 8582 nonzeros Variable types: 0 continuous, 3098 integer (0 binary) Found heuristic solution: objective 352.0000000 Found heuristic solution: objective 325.0000000 Optimize a model with 436 rows, 3098 columns and 8582 nonzeros Presolved: 436 rows, 3098 columns, 8582 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.492e+03 Factor NZ : 2.791e+04 (roughly 2 MBytes of memory) Factor Ops : 3.183e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.39123061e+03 -7.90330212e+04 5.90e+04 2.22e-16 1.45e+02 0s 1 1.14842541e+03 -5.10829645e+04 1.02e+04 8.88e-16 2.97e+01 0s 2 5.50173506e+02 -2.05286011e+04 1.87e+03 5.77e-15 6.57e+00 0s 3 4.11815860e+02 -4.25368472e+03 2.31e+02 6.66e-15 1.04e+00 0s 4 3.89105879e+02 -1.21223653e+03 1.36e+01 7.69e-15 2.68e-01 0s 5 3.82641228e+02 -5.76211640e+02 1.32e-01 5.03e-15 1.54e-01 0s 6 3.71091523e+02 -4.22591680e+02 8.50e-02 3.73e-15 1.28e-01 0s 7 3.31966484e+02 -1.93324206e+02 3.52e-02 3.29e-15 8.45e-02 0s 8 2.77969888e+02 1.40064580e+01 1.79e-02 3.43e-15 4.24e-02 0s 9 2.22053621e+02 1.03624486e+02 6.18e-03 3.92e-15 1.90e-02 0s 10 2.03427148e+02 1.37101481e+02 2.47e-03 2.70e-15 1.07e-02 0s 11 1.98323706e+02 1.64043123e+02 1.38e-03 2.69e-15 5.51e-03 0s 12 1.91542971e+02 1.89213113e+02 1.25e-04 3.07e-15 3.75e-04 0s 13 1.90510258e+02 1.90483245e+02 1.05e-06 2.28e-15 4.34e-06 0s 14 1.90500010e+02 1.90499983e+02 2.25e-12 2.03e-15 4.34e-09 0s 15 1.90500000e+02 1.90500000e+02 9.63e-12 2.10e-15 4.34e-12 0s Barrier solved model in 15 iterations and 0.10 seconds Optimal objective 1.90500000e+02 Root relaxation: objective 1.905000e+02, 1213 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 190.50000 0 3 325.00000 190.50000 41.4% - 0s H 0 0 191.0000000 190.50000 0.26% - 0s Explored 0 nodes (1637 simplex iterations) in 0.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.910000000000e+02, best bound 1.910000000000e+02, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.25 seconds Total run time: 0.33 seconds Objective: 191 Solution: 8 x [5, 23] 6 x [5, 19] 5 x [3, 5] 5 x [19, 40] 10 x [31, 40] 4 x [36] 2 x [34, 36] 4 x [19, 36] 2 x [24, 37] 3 x [22] 6 x [1, 22] 2 x [4, 4, 22] 2 x [1, 18] 2 x [18, 39] 6 x [9, 18] 2 x [11, 19] 3 x [10, 20] 5 x [10, 16] 5 x [9, 10] 7 x [8, 39] 4 x [2, 7, 37] 5 x [7, 37, 37] 3 x [16, 33] 2 x [21] 6 x [21, 29] 4 x [21, 25] 5 x [9, 21] 1 x [17] 7 x [17, 27] 9 x [26, 38] 7 x [6, 26] 6 x [13] 4 x [13, 38] 6 x [4, 13, 14, 25] 6 x [12, 15] 6 x [12, 14, 35] 5 x [12, 29] 5 x [30, 32] 1 x [28] 4 x [28, 28] 6 x [14, 32, 32]