Build (method = -2) #dp: 10910 Step-3' Graph: 592 vertices and 4218 arcs (0.07s) Step-4' Graph: 592 vertices and 4218 arcs (0.08s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.08s) Optimize a model with 631 rows, 4219 columns and 11489 nonzeros Presolve removed 98 rows and 223 columns Presolve time: 0.07s Presolved: 533 rows, 3996 columns, 11137 nonzeros Variable types: 0 continuous, 3996 integer (24 binary) Found heuristic solution: objective 364.0000000 Found heuristic solution: objective 322.0000000 Optimize a model with 533 rows, 3996 columns and 11137 nonzeros Presolved: 533 rows, 3996 columns, 11137 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 7.226e+03 Factor NZ : 4.851e+04 (roughly 2 MBytes of memory) Factor Ops : 7.841e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.67356926e+03 -1.15675977e+05 1.31e+05 7.13e-02 2.32e+02 0s 1 1.91520867e+03 -7.19633176e+04 2.02e+04 7.77e-15 4.06e+01 0s 2 7.74404169e+02 -3.55017063e+04 3.63e+03 4.33e-15 9.44e+00 0s 3 5.77437467e+02 -8.15970378e+03 8.22e+02 7.99e-15 1.93e+00 0s 4 4.42242462e+02 -4.25713131e+03 1.48e+02 3.77e-14 7.15e-01 0s 5 4.10102453e+02 -1.94729787e+03 2.23e-01 7.99e-15 2.94e-01 0s 6 3.75413847e+02 -1.00845124e+03 1.04e-12 4.91e-15 1.73e-01 0s 7 3.66530194e+02 -5.74438619e+02 7.67e-13 5.34e-15 1.17e-01 0s 8 3.25366514e+02 -3.75305933e+02 7.96e-13 6.44e-15 8.74e-02 0s 9 3.00295962e+02 -1.82565143e+02 6.54e-13 6.49e-15 6.02e-02 0s 10 2.61014913e+02 -3.42607361e+01 5.12e-13 5.69e-15 3.68e-02 0s 11 2.15555344e+02 6.83795428e+01 2.84e-13 5.31e-15 1.84e-02 0s 12 2.00521298e+02 1.55179857e+02 8.53e-14 4.17e-15 5.65e-03 0s 13 1.94361705e+02 1.81400443e+02 1.61e-13 4.16e-15 1.62e-03 0s 14 1.91785478e+02 1.89886852e+02 8.24e-13 5.66e-15 2.37e-04 0s 15 1.91253222e+02 1.91248499e+02 3.37e-13 3.62e-15 5.89e-07 0s 16 1.91250000e+02 1.91250000e+02 4.26e-13 6.34e-15 6.28e-13 0s Barrier solved model in 16 iterations and 0.17 seconds Optimal objective 1.91250000e+02 Root relaxation: objective 1.912500e+02, 1772 iterations, 0.19 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 191.25000 0 22 322.00000 191.25000 40.6% - 0s H 0 0 192.0000000 191.25000 0.39% - 0s Explored 0 nodes (2377 simplex iterations) in 0.45 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.920000000000e+02, best bound 1.920000000000e+02, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.45 seconds Total run time: 0.56 seconds Objective: 192 Solution: 6 x [7] 9 x [7, 13] 2 x [7, 18] 3 x [6, 18] 18 x [6, 11] 6 x [6, 20, 36] 2 x [6, 20] 10 x [3, 4, 36] 14 x [12, 30] 5 x [19] 1 x [4, 19, 30] 7 x [19, 20, 31] 2 x [4, 19] 2 x [24] 10 x [15] 5 x [10, 15] 1 x [15, 38] 5 x [2, 17] 10 x [1, 17] 2 x [9, 23] 2 x [28, 39] 9 x [22, 39] 5 x [5, 34] 1 x [5, 14, 22] 6 x [5, 8] 3 x [5, 5] 7 x [9, 28] 2 x [22, 27] 3 x [1, 25] 5 x [8, 33] 4 x [9, 9] 5 x [1, 27, 38] 2 x [26, 37] 2 x [32, 35] 1 x [32] 2 x [29, 32] 6 x [16, 26, 27] 1 x [21, 27] 4 x [21, 21, 27] 2 x [26, 26]