Build (method = -2) #dp: 1038 Step-3' Graph: 128 vertices and 506 arcs (0.00s) Step-4' Graph: 110 vertices and 470 arcs (0.00s) #V4/#V3 = 0.86 #A4/#A3 = 0.93 Ready! (0.00s) Optimize a model with 130 rows, 471 columns and 1213 nonzeros Presolve removed 24 rows and 38 columns Presolve time: 0.00s Presolved: 106 rows, 433 columns, 1142 nonzeros Variable types: 0 continuous, 433 integer (0 binary) Found heuristic solution: objective 1738.0000000 Found heuristic solution: objective 1506.0000000 Optimize a model with 106 rows, 433 columns and 1142 nonzeros Presolved: 106 rows, 433 columns, 1142 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.780e+02 Factor NZ : 2.503e+03 Factor Ops : 7.158e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.16442068e+03 -6.71632712e+04 6.29e+04 2.22e-16 5.09e+02 0s 1 3.57178070e+03 -2.94696542e+04 1.09e+04 6.66e-16 9.88e+01 0s 2 1.95775891e+03 -7.40061577e+03 7.73e+02 4.44e-16 1.36e+01 0s 3 1.69894039e+03 -1.51010222e+03 1.26e+01 4.46e-16 3.69e+00 0s 4 1.32032020e+03 -1.80356875e+02 1.10e+00 3.16e-16 1.71e+00 0s 5 1.15523460e+03 4.52363578e+02 4.22e-01 2.43e-16 8.03e-01 0s 6 1.04890210e+03 8.44067138e+02 1.16e-01 1.54e-16 2.34e-01 0s 7 1.00588795e+03 9.40532347e+02 3.05e-02 1.55e-16 7.46e-02 0s 8 9.90010388e+02 9.79151023e+02 1.39e-03 2.84e-16 1.24e-02 0s 9 9.88690165e+02 9.88626048e+02 3.21e-12 3.34e-16 7.32e-05 0s 10 9.88666690e+02 9.88666626e+02 1.23e-12 2.22e-16 7.32e-08 0s 11 9.88666667e+02 9.88666667e+02 1.06e-12 2.22e-16 7.39e-14 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 9.88666667e+02 Root relaxation: objective 9.886667e+02, 125 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 988.66667 0 8 1506.00000 988.66667 34.4% - 0s H 0 0 990.0000000 988.66667 0.13% - 0s 0 0 988.66667 0 8 990.00000 988.66667 0.13% - 0s H 0 0 989.0000000 988.66667 0.03% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (177 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.890000000000e+02, best bound 9.890000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 989 Solution: 3 x [18] 114 x [2, 18] 65 x [18, 19] 11 x [2, 12] 65 x [17] 20 x [1, 17] 1 x [16, 16, 17] 9 x [16, 16, 16, 16, 17] 38 x [10] 1 x [10, 20] 96 x [10, 20, 20] 5 x [14, 15] 54 x [7, 14] 163 x [11, 13] 24 x [13, 14] 21 x [4, 8] 24 x [8, 11] 94 x [3, 5] 1 x [6, 9] 1 x [3, 9] 47 x [9, 9] 87 x [6, 6] 40 x [3, 3] 1 x [14, 14] 4 x [14, 14, 14]