Build (method = -2) #dp: 4623 Step-3' Graph: 245 vertices and 912 arcs (0.02s) Step-4' Graph: 190 vertices and 802 arcs (0.02s) #V4/#V3 = 0.78 #A4/#A3 = 0.88 Ready! (0.02s) Optimize a model with 199 rows, 803 columns and 2041 nonzeros Presolve removed 48 rows and 95 columns Presolve time: 0.01s Presolved: 151 rows, 708 columns, 1880 nonzeros Variable types: 0 continuous, 708 integer (0 binary) Found heuristic solution: objective 996.0000000 Found heuristic solution: objective 907.0000000 Found heuristic solution: objective 903.0000000 Optimize a model with 151 rows, 708 columns and 1880 nonzeros Presolved: 151 rows, 708 columns, 1880 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.074e+03 Factor NZ : 3.770e+03 Factor Ops : 1.170e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.60701388e+03 -7.18416675e+04 6.17e+04 2.22e-16 2.85e+02 0s 1 1.57866757e+03 -3.27791400e+04 1.23e+04 5.55e-16 6.33e+01 0s 2 1.05616322e+03 -1.11815835e+04 2.46e+03 6.66e-16 1.46e+01 0s 3 8.92662905e+02 -1.79159562e+03 1.63e+02 5.27e-16 2.10e+00 0s 4 6.01051907e+02 -5.72002197e+02 5.88e+01 4.72e-16 8.81e-01 0s 5 4.70450950e+02 -4.42056800e+02 4.57e+01 3.95e-16 6.84e-01 0s 6 2.26940077e+02 -2.69686357e+02 1.84e+01 5.55e-16 3.65e-01 0s 7 1.84257529e+02 -1.02056030e+02 1.26e+01 4.70e-16 2.11e-01 0s 8 1.65375768e+02 1.75890083e+01 9.19e+00 2.66e-16 1.10e-01 0s 9 1.44169010e+02 7.50524013e+01 5.79e+00 2.79e-16 5.14e-02 0s 10 1.24998652e+02 9.07143078e+01 2.98e+00 3.52e-16 2.53e-02 0s 11 1.15677664e+02 1.05735293e+02 8.45e-01 2.73e-16 7.23e-03 0s 12 1.11822743e+02 1.09655145e+02 1.29e-01 2.54e-16 1.55e-03 0s 13 1.11184919e+02 1.10948652e+02 8.01e-03 3.13e-16 1.68e-04 0s 14 1.11111267e+02 1.11110881e+02 3.24e-06 2.81e-16 2.72e-07 0s 15 1.11111111e+02 1.11111111e+02 1.50e-10 4.31e-16 2.75e-13 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 380 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 32 903.00000 111.11111 87.7% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (865 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 112 Solution: 18 x [1, 1, 3, 3, 4, 6, 7, 8, 9] 17 x [1, 1, 2, 3, 4, 4, 6, 8, 9] 44 x [3, 4, 4, 5, 6, 6, 6, 7, 9] 1 x [2, 2, 2, 2, 2, 9] 1 x [1, 1, 6, 7, 8, 9, 9, 9] 1 x [1, 1, 7, 9, 9, 9] 9 x [5, 6, 6, 6, 6, 8, 9, 9, 9] 3 x [1, 1, 5, 8, 8, 8, 9, 9, 9] 1 x [1, 1, 8, 8, 8, 9, 9, 9] 6 x [2, 3, 3, 4, 4, 5, 6, 6, 8] 11 x [1, 1, 3, 3, 3, 3, 5, 5, 8]