Build (method = -2) #dp: 7605 Step-3' Graph: 1346 vertices and 4031 arcs (0.06s) Step-4' Graph: 653 vertices and 2645 arcs (0.07s) #V4/#V3 = 0.49 #A4/#A3 = 0.66 Ready! (0.07s) Optimize a model with 693 rows, 2646 columns and 6636 nonzeros Presolve removed 114 rows and 216 columns Presolve time: 0.05s Presolved: 579 rows, 2430 columns, 6519 nonzeros Variable types: 0 continuous, 2430 integer (0 binary) Found heuristic solution: objective 272.0000000 Optimize a model with 579 rows, 2430 columns and 6519 nonzeros Presolved: 579 rows, 2430 columns, 6519 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 4.434e+03 Factor NZ : 2.556e+04 (roughly 1 MByte of memory) Factor Ops : 2.084e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.77935656e+03 -4.31426025e+04 1.29e+05 2.22e-16 1.47e+02 0s 1 9.60338027e+02 -2.54199735e+04 1.48e+04 6.66e-16 2.03e+01 0s 2 4.87098743e+02 -1.00852058e+04 3.32e+03 1.40e-14 5.12e+00 0s 3 3.26977015e+02 -2.68409901e+03 5.96e+02 8.88e-15 1.04e+00 0s 4 2.83518590e+02 -6.64250651e+02 6.79e+01 6.66e-15 2.27e-01 0s 5 2.76402818e+02 -3.85781761e+02 2.54e+01 5.55e-15 1.45e-01 0s 6 2.61079684e+02 -2.60314275e+02 1.50e+01 4.44e-15 1.12e-01 0s 7 2.40100296e+02 -1.11816394e+02 6.46e+00 2.53e-15 7.38e-02 0s 8 2.15743583e+02 4.42927783e+01 1.97e+00 1.45e-15 3.55e-02 0s 9 1.94365788e+02 9.85516602e+01 8.81e-01 1.51e-15 1.98e-02 0s 10 1.89202212e+02 1.19700530e+02 6.96e-01 1.51e-15 1.43e-02 0s 11 1.79363716e+02 1.42234472e+02 3.57e-01 1.49e-15 7.66e-03 0s 12 1.74687134e+02 1.47678717e+02 1.99e-01 1.82e-15 5.56e-03 0s 13 1.69976756e+02 1.61410345e+02 5.81e-02 1.22e-15 1.76e-03 0s 14 1.68141474e+02 1.67540354e+02 2.97e-03 1.35e-15 1.24e-04 0s 15 1.68001141e+02 1.67997021e+02 2.33e-12 1.35e-15 8.43e-07 0s 16 1.68000000e+02 1.68000000e+02 7.10e-12 1.38e-15 9.32e-13 0s Barrier solved model in 16 iterations and 0.07 seconds Optimal objective 1.68000000e+02 Root relaxation: objective 1.680000e+02, 931 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 168.0000000 168.00000 0.0% - 0s Explored 0 nodes (931 simplex iterations) in 0.18 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.680000000000e+02, best bound 1.680000000000e+02, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.18 seconds Total run time: 0.27 seconds Objective: 168 Solution: 3 x [1, 28] 10 x [1, 31] 5 x [1, 32] 3 x [2, 29] 1 x [2, 32, 35] 3 x [2, 32, 35, 39] 3 x [2, 34, 35] 7 x [3, 26] 2 x [3, 30] 2 x [3, 31, 35] 1 x [3, 31, 35, 38] 3 x [3, 31, 37] 1 x [3, 32] 5 x [3, 32, 34, 37] 3 x [4] 3 x [4, 27] 3 x [4, 38] 2 x [5, 29, 33] 6 x [5, 32] 1 x [6, 28] 2 x [6, 33, 40] 5 x [7, 24] 5 x [8, 24] 6 x [8, 25] 9 x [9, 21] 1 x [10] 6 x [10, 21] 3 x [10, 24] 3 x [11] 4 x [12, 21] 3 x [12, 22] 12 x [12, 23] 8 x [13, 19] 9 x [13, 20, 39] 2 x [14, 15] 2 x [14, 19] 3 x [14, 19, 36] 1 x [14, 20] 2 x [15, 19, 34] 3 x [15, 20, 35] 3 x [16, 17, 37] 2 x [16, 19, 35] 3 x [17, 20, 34, 35] 4 x [18, 19, 34, 38, 39]