Build (method = -2) #dp: 3512 Step-3' Graph: 650 vertices and 1943 arcs (0.02s) Step-4' Graph: 288 vertices and 1219 arcs (0.03s) #V4/#V3 = 0.44 #A4/#A3 = 0.63 Ready! (0.03s) Optimize a model with 328 rows, 1220 columns and 3088 nonzeros Presolve removed 78 rows and 119 columns Presolve time: 0.02s Presolved: 250 rows, 1101 columns, 3006 nonzeros Variable types: 0 continuous, 1101 integer (144 binary) Found heuristic solution: objective 267.0000000 Found heuristic solution: objective 261.0000000 Optimize a model with 250 rows, 1101 columns and 3006 nonzeros Presolved: 250 rows, 1101 columns, 3006 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.125e+03 Factor NZ : 7.587e+03 Factor Ops : 3.319e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.84770778e+03 -1.65113039e+04 2.46e+04 1.23e-01 5.98e+01 0s 1 7.20267187e+02 -8.41692775e+03 4.92e+03 1.78e-15 1.34e+01 0s 2 3.89620134e+02 -2.73014485e+03 6.76e+02 1.33e-15 2.44e+00 0s 3 2.89135771e+02 -3.34404320e+02 7.10e+01 1.22e-15 3.55e-01 0s 4 2.51764849e+02 -6.64819653e+01 2.69e+01 1.11e-15 1.64e-01 0s 5 2.28507776e+02 2.82462616e+01 1.26e+01 1.33e-15 9.80e-02 0s 6 2.11230394e+02 1.01809804e+02 6.63e+00 1.06e-15 5.26e-02 0s 7 2.02678506e+02 1.23580574e+02 4.49e+00 1.29e-15 3.76e-02 0s 8 1.92496418e+02 1.54271574e+02 2.15e+00 1.47e-15 1.81e-02 0s 9 1.84324493e+02 1.76455913e+02 2.66e-01 1.33e-15 3.64e-03 0s 10 1.83078899e+02 1.82464512e+02 1.58e-02 1.40e-15 2.83e-04 0s 11 1.83004078e+02 1.82996078e+02 1.32e-03 1.25e-15 4.21e-06 0s 12 1.83000000e+02 1.83000000e+02 1.30e-08 1.10e-15 3.37e-11 0s Barrier solved model in 12 iterations and 0.02 seconds Optimal objective 1.83000000e+02 Root relaxation: objective 1.830000e+02, 622 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 183.0000000 183.00000 0.0% - 0s Explored 0 nodes (789 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.830000000000e+02, best bound 1.830000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.05 seconds Total run time: 0.09 seconds Objective: 183 Solution: 6 x [1, 34] 5 x [1, 34, 37] 2 x [2] 1 x [2, 35] 4 x [2, 35, 36] 1 x [2, 40] 5 x [3, 32] 1 x [3, 33, 39] 7 x [3, 39] 3 x [4] 15 x [4, 31] 1 x [5, 32] 5 x [5, 32, 34] 12 x [5, 33, 36, 37] 10 x [6] 1 x [6, 29] 7 x [6, 30] 11 x [7, 26] 1 x [7, 28] 3 x [8, 24] 4 x [9, 22] 4 x [9, 23] 1 x [10, 24] 2 x [10, 25, 38] 1 x [10, 32] 4 x [11, 21] 2 x [12, 19] 11 x [12, 21] 13 x [13, 20] 1 x [14] 1 x [15, 21] 6 x [15, 24] 10 x [15, 28, 35] 11 x [16, 19] 2 x [17, 18] 1 x [18, 20] 7 x [18, 23] 1 x [18, 27]