Build (method = -2) #dp: 5113 Step-3' Graph: 446 vertices and 2754 arcs (0.03s) Step-4' Graph: 434 vertices and 2730 arcs (0.04s) #V4/#V3 = 0.97 #A4/#A3 = 0.99 Ready! (0.04s) Optimize a model with 472 rows, 2731 columns and 7335 nonzeros Presolve removed 75 rows and 127 columns Presolve time: 0.04s Presolved: 397 rows, 2604 columns, 7151 nonzeros Variable types: 0 continuous, 2604 integer (1 binary) Found heuristic solution: objective 328.0000000 Optimize a model with 397 rows, 2604 columns and 7151 nonzeros Presolved: 397 rows, 2604 columns, 7151 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.248e+03 Factor NZ : 2.138e+04 (roughly 1 MByte of memory) Factor Ops : 1.942e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.11014695e+03 -5.41529137e+04 4.18e+04 2.22e-16 9.54e+01 0s 1 8.57395505e+02 -2.97139530e+04 8.40e+03 6.66e-16 2.18e+01 0s 2 5.00180028e+02 -1.08542844e+04 1.63e+03 1.55e-15 4.84e+00 0s 3 4.11654621e+02 -4.09158524e+03 1.81e+02 3.55e-15 1.09e+00 0s 4 3.93002794e+02 -6.83397285e+02 2.24e+01 1.55e-15 2.18e-01 0s 5 3.87156571e+02 -5.07848544e+02 1.77e+01 1.42e-15 1.80e-01 0s 6 3.62615357e+02 -4.74291962e+02 1.11e+01 1.55e-15 1.65e-01 0s 7 3.10056532e+02 -1.33723664e+02 4.25e+00 9.85e-16 8.64e-02 0s 8 2.70875922e+02 8.01234782e+01 2.03e+00 5.84e-16 3.70e-02 0s 9 2.35595837e+02 1.35640172e+02 8.42e-01 7.13e-16 1.93e-02 0s 10 2.17312495e+02 1.79814055e+02 3.04e-01 5.42e-16 7.25e-03 0s 11 2.09443374e+02 2.02176019e+02 4.73e-02 5.70e-16 1.40e-03 0s 12 2.07576003e+02 2.07270550e+02 9.38e-04 5.86e-16 5.87e-05 0s 13 2.07500077e+02 2.07499771e+02 6.68e-13 5.43e-16 5.87e-08 0s 14 2.07500000e+02 2.07500000e+02 6.91e-13 5.99e-16 5.87e-11 0s 15 2.07500000e+02 2.07500000e+02 3.89e-13 6.38e-16 5.87e-14 0s Barrier solved model in 15 iterations and 0.08 seconds Optimal objective 2.07500000e+02 Root relaxation: objective 2.075000e+02, 882 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 207.50000 0 7 328.00000 207.50000 36.7% - 0s H 0 0 208.0000000 207.50000 0.24% - 0s Explored 0 nodes (1412 simplex iterations) in 0.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.080000000000e+02, best bound 2.080000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.25 seconds Total run time: 0.31 seconds Objective: 208 Solution: 12 x [11] 12 x [11, 13] 7 x [11, 26] 1 x [11, 23] 6 x [11, 23, 23] 1 x [9] 1 x [9, 35] 2 x [5] 2 x [5, 18] 3 x [5, 26] 1 x [5, 17, 26] 3 x [5, 17, 17, 26] 1 x [26, 30] 1 x [13, 26, 29] 6 x [22] 3 x [2, 22] 5 x [22, 28] 2 x [13, 22] 4 x [13, 22, 26] 13 x [21, 28] 2 x [21, 35] 1 x [21, 26] 15 x [4, 20] 5 x [15, 16] 6 x [10, 25] 1 x [10, 16] 2 x [8, 34] 5 x [1] 1 x [1, 14] 2 x [1, 14, 14, 14] 1 x [33] 6 x [25, 33] 8 x [37] 2 x [27] 4 x [27, 36] 5 x [27, 31] 4 x [25, 27] 2 x [27, 32] 6 x [12, 19] 15 x [6, 19] 10 x [7, 24] 3 x [3, 24] 12 x [3, 12] 2 x [24, 38] 1 x [12, 24] 1 x [12]