Build (method = -2) #dp: 19784 Step-3' Graph: 265 vertices and 2070 arcs (0.10s) Step-4' Graph: 200 vertices and 1940 arcs (0.10s) #V4/#V3 = 0.75 #A4/#A3 = 0.94 Ready! (0.10s) Optimize a model with 240 rows, 1941 columns and 5431 nonzeros Presolve removed 8 rows and 17 columns Presolve time: 0.01s Presolved: 232 rows, 1924 columns, 5420 nonzeros Variable types: 0 continuous, 1924 integer (0 binary) Found heuristic solution: objective 2014.0000000 Found heuristic solution: objective 1708.0000000 Optimize a model with 232 rows, 1924 columns and 5420 nonzeros Presolved: 232 rows, 1924 columns, 5420 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.519e+03 Factor NZ : 9.431e+03 Factor Ops : 4.743e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.84915674e+04 -3.42724530e+05 2.93e+05 2.22e-16 7.49e+02 0s 1 1.38782701e+04 -9.56560696e+04 5.57e+04 1.67e-15 1.42e+02 0s 2 3.94518788e+03 -4.03690836e+04 9.01e+03 2.55e-15 2.77e+01 0s 3 1.99454902e+03 -9.25644100e+03 7.68e+02 3.55e-15 3.91e+00 0s 4 1.48748964e+03 -3.77135100e+03 2.09e+02 2.22e-15 1.55e+00 0s 5 9.27729582e+02 -2.04315068e+03 8.93e+01 1.33e-15 8.32e-01 0s 6 6.76796147e+02 -8.52014842e+02 4.63e+01 1.25e-15 4.20e-01 0s 7 5.65849489e+02 -3.43686699e+02 3.10e+01 1.11e-15 2.49e-01 0s 8 4.62155255e+02 4.33230979e+01 1.59e+01 1.08e-15 1.14e-01 0s 9 4.33821878e+02 3.47345606e+02 3.43e+00 9.94e-16 2.29e-02 0s 10 4.04635726e+02 3.95617047e+02 7.12e-02 1.05e-15 2.33e-03 0s 11 4.03227992e+02 4.03108245e+02 9.65e-04 1.10e-15 3.09e-05 0s 12 4.03200000e+02 4.03199999e+02 9.26e-10 1.12e-15 2.41e-10 0s Barrier solved model in 12 iterations and 0.02 seconds Optimal objective 4.03200000e+02 Root relaxation: objective 4.032000e+02, 1475 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 403.20000 0 19 1708.00000 403.20000 76.4% - 0s H 0 0 405.0000000 403.20000 0.44% - 0s H 0 0 404.0000000 403.20000 0.20% - 0s Explored 0 nodes (2381 simplex iterations) in 0.14 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.040000000000e+02, best bound 4.040000000000e+02, gap 0.0% Preprocessing time: 0.12 seconds Gurobi run time: 0.14 seconds Total run time: 0.26 seconds Objective: 404 Solution: 22 x [1, 20, 24, 30, 36] 21 x [3, 6, 8, 31, 38] 7 x [4, 6, 21, 24, 38] 1 x [6, 31, 37, 38, 38] 69 x [17, 21, 22, 24, 37] 30 x [5, 9, 11, 22, 35] 16 x [6, 14, 39, 39, 40] 42 x [2, 26, 33, 36, 39] 2 x [20, 23, 23, 29, 39] 1 x [6, 14, 19, 39] 9 x [6, 18, 21, 31, 39] 1 x [5, 19, 39, 39] 6 x [1, 6, 12, 39, 39] 5 x [3, 3, 16, 17, 18] 19 x [3, 5, 10, 11, 13] 1 x [10, 11, 21, 34] 9 x [10, 10, 11, 21, 34] 1 x [3, 11, 16, 18, 37] 1 x [3, 11, 16, 32] 7 x [6, 11, 15, 18, 37] 1 x [2, 3, 5, 25, 29] 3 x [8, 12, 19, 25, 34] 1 x [2, 18, 27, 28, 29] 6 x [2, 18, 19, 27, 28] 35 x [3, 7, 18, 19, 26] 8 x [7, 18, 19, 19, 28] 19 x [5, 7, 18, 19, 19] 3 x [2, 5, 18, 29, 35] 4 x [4, 18, 29, 36, 37] 1 x [4, 14, 29, 32, 34] 40 x [4, 4, 29, 32, 34] 1 x [29, 29, 29, 29, 29] 12 x [3, 5, 9, 12, 20]