Build (method = -2) #dp: 30035 Step-3' Graph: 232 vertices and 916 arcs (0.17s) Step-4' Graph: 114 vertices and 680 arcs (0.17s) #V4/#V3 = 0.49 #A4/#A3 = 0.74 Ready! (0.17s) Optimize a model with 134 rows, 681 columns and 1825 nonzeros Presolve removed 16 rows and 38 columns Presolve time: 0.00s Presolved: 118 rows, 643 columns, 1768 nonzeros Variable types: 0 continuous, 643 integer (0 binary) Found heuristic solution: objective 1995.0000000 Found heuristic solution: objective 1350.0000000 Optimize a model with 118 rows, 643 columns and 1768 nonzeros Presolved: 118 rows, 643 columns, 1768 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.026e+03 Factor NZ : 2.869e+03 Factor Ops : 8.163e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.57567231e+04 -2.28858119e+05 1.45e+05 2.22e-16 1.02e+03 0s 1 5.93466759e+03 -7.32570713e+04 1.95e+04 1.11e-15 1.56e+02 0s 2 2.31501346e+03 -2.40953025e+04 2.58e+03 1.11e-15 3.05e+01 0s 3 1.63178839e+03 -4.37947985e+03 1.52e+02 3.44e-15 4.92e+00 0s 4 9.01791305e+02 -1.23085990e+03 2.58e+01 7.25e-16 1.66e+00 0s 5 6.27587463e+02 -6.13114716e+02 1.54e+01 8.66e-16 9.66e-01 0s 6 4.42504752e+02 -2.22909024e+02 8.85e+00 1.42e-15 5.17e-01 0s 7 3.45519410e+02 8.30853528e+01 4.87e+00 8.21e-16 2.04e-01 0s 8 3.12360127e+02 2.52855875e+02 2.19e+00 7.55e-16 4.62e-02 0s 9 2.99512500e+02 2.77503763e+02 1.10e+00 7.52e-16 1.70e-02 0s 10 2.85884954e+02 2.85093805e+02 9.22e-13 1.05e-15 6.06e-04 0s 11 2.85714456e+02 2.85713665e+02 4.38e-13 8.27e-16 6.06e-07 0s 12 2.85714286e+02 2.85714285e+02 1.00e-12 8.88e-16 6.06e-10 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 2.85714286e+02 Root relaxation: objective 2.857143e+02, 424 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 285.71429 0 28 1350.00000 285.71429 78.8% - 0s H 0 0 289.0000000 285.71429 1.14% - 0s H 0 0 286.0000000 285.71429 0.10% - 0s Explored 0 nodes (568 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.860000000000e+02, best bound 2.860000000000e+02, gap 0.0% Preprocessing time: 0.18 seconds Gurobi run time: 0.03 seconds Total run time: 0.21 seconds Objective: 286 Solution: 1 x [1, 3, 10, 10, 11, 13, 19] 67 x [2, 3, 5, 8, 9, 11, 16] 17 x [3, 9, 14, 14, 15, 16, 20] 1 x [2, 3, 9, 14, 14, 19, 20] 2 x [3, 3, 5, 10, 10, 11, 16] 48 x [1, 5, 9, 11, 13, 14, 15] 6 x [1, 2, 11, 12, 13, 14, 16] 22 x [1, 2, 8, 11, 13, 14, 14] 1 x [1, 4, 7, 8, 10, 10, 19] 25 x [2, 4, 4, 4, 14, 16, 16] 46 x [1, 1, 7, 9, 11, 12, 18] 1 x [1, 1, 7, 8, 11, 12, 16] 14 x [2, 5, 6, 9, 11, 16, 18] 8 x [5, 6, 8, 10, 10, 14, 19] 23 x [5, 5, 8, 10, 10, 17, 19] 3 x [7, 8, 9, 12, 14, 19, 20] 1 x [10, 10, 14, 14, 16]