Build (method = -2) #dp: 5947 Step-3' Graph: 442 vertices and 2851 arcs (0.03s) Step-4' Graph: 432 vertices and 2831 arcs (0.03s) #V4/#V3 = 0.98 #A4/#A3 = 0.99 Ready! (0.03s) Optimize a model with 471 rows, 2832 columns and 7645 nonzeros Presolve removed 70 rows and 128 columns Presolve time: 0.05s Presolved: 401 rows, 2704 columns, 7462 nonzeros Variable types: 0 continuous, 2704 integer (23 binary) Found heuristic solution: objective 316.0000000 Optimize a model with 401 rows, 2704 columns and 7462 nonzeros Presolved: 401 rows, 2704 columns, 7462 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.829e+03 Factor NZ : 2.462e+04 (roughly 1 MByte of memory) Factor Ops : 2.621e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.18433578e+03 -5.82974014e+04 6.22e+04 9.31e-02 1.32e+02 0s 1 1.11177992e+03 -3.12427113e+04 1.01e+04 8.88e-16 2.41e+01 0s 2 5.92993981e+02 -1.34100807e+04 1.54e+03 2.22e-15 4.85e+00 0s 3 4.58071130e+02 -3.20660585e+03 3.50e+02 9.55e-15 1.04e+00 0s 4 3.99870924e+02 -7.83170631e+02 2.28e+01 4.33e-15 2.33e-01 0s 5 3.81685878e+02 -3.72520586e+02 1.30e+01 2.78e-15 1.45e-01 0s 6 3.75492044e+02 -2.71188477e+02 1.13e+01 2.11e-15 1.24e-01 0s 7 3.65432366e+02 -1.96360171e+02 8.13e+00 2.11e-15 1.06e-01 0s 8 3.33101571e+02 -9.46848375e+01 3.08e+00 1.33e-15 7.98e-02 0s 9 2.83777298e+02 2.89745191e+01 1.16e+00 8.88e-16 4.73e-02 0s 10 2.52227757e+02 6.70141168e+01 7.41e-01 6.66e-16 3.43e-02 0s 11 2.32212293e+02 1.30891771e+02 4.69e-01 3.37e-16 1.88e-02 0s 12 2.13139971e+02 1.74982577e+02 1.57e-01 3.58e-16 7.07e-03 0s 13 2.06718244e+02 1.96760344e+02 3.13e-02 3.14e-16 1.84e-03 0s 14 2.04605728e+02 2.04379343e+02 1.26e-03 4.39e-16 4.20e-05 0s 15 2.04500107e+02 2.04499879e+02 5.12e-13 4.11e-16 4.20e-08 0s 16 2.04500000e+02 2.04500000e+02 1.79e-12 3.94e-16 4.20e-11 0s 17 2.04500000e+02 2.04500000e+02 3.13e-13 4.02e-16 4.20e-14 0s Barrier solved model in 17 iterations and 0.10 seconds Optimal objective 2.04500000e+02 Root relaxation: objective 2.045000e+02, 1464 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 204.50000 0 2 316.00000 204.50000 35.3% - 0s H 0 0 205.0000000 204.50000 0.24% - 0s Explored 0 nodes (2227 simplex iterations) in 0.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.050000000000e+02, best bound 2.050000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.25 seconds Total run time: 0.30 seconds Objective: 205 Solution: 4 x [2] 4 x [2, 14] 6 x [37] 2 x [31, 37] 3 x [26, 37] 2 x [7, 37] 5 x [5, 6, 37] 9 x [9, 13] 4 x [8, 9] 4 x [7, 9, 28] 1 x [39] 9 x [23, 39] 1 x [29, 39] 2 x [12, 17, 39] 3 x [7, 39] 3 x [5, 39] 4 x [23, 36] 3 x [36, 38] 1 x [31, 36] 2 x [14, 36] 3 x [33, 35] 1 x [14, 35] 4 x [14, 30, 30, 35] 1 x [17, 25] 4 x [21, 33] 2 x [21, 23] 2 x [14, 17, 21] 5 x [6, 14, 17, 21] 9 x [20] 18 x [15, 19] 9 x [16] 1 x [15, 16] 5 x [10] 6 x [10, 22] 4 x [18, 27] 14 x [18, 22] 5 x [4, 27] 4 x [3, 27] 9 x [1] 7 x [1, 24] 15 x [11, 32] 3 x [5, 11, 26] 1 x [34] 1 x [34, 34]