Build (method = -2) #dp: 6265 Step-3' Graph: 307 vertices and 1202 arcs (0.03s) Step-4' Graph: 240 vertices and 1068 arcs (0.03s) #V4/#V3 = 0.78 #A4/#A3 = 0.89 Ready! (0.03s) Optimize a model with 250 rows, 1069 columns and 2739 nonzeros Presolve removed 64 rows and 120 columns Presolve time: 0.01s Presolved: 186 rows, 949 columns, 2569 nonzeros Variable types: 0 continuous, 949 integer (0 binary) Found heuristic solution: objective 881.0000000 Optimize a model with 186 rows, 949 columns and 2569 nonzeros Presolved: 186 rows, 949 columns, 2569 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.469e+03 Factor NZ : 5.504e+03 Factor Ops : 2.030e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.56993330e+03 -1.48631614e+05 1.91e+05 2.22e-16 6.55e+02 0s 1 2.36096146e+03 -8.85493337e+04 2.56e+04 9.99e-16 1.16e+02 0s 2 1.39669143e+03 -3.07742693e+04 6.62e+03 6.66e-16 3.16e+01 0s 3 1.02962913e+03 -6.78834417e+03 5.35e+02 1.29e-14 4.97e+00 0s 4 9.40866524e+02 -2.78340126e+03 1.68e-10 5.77e-15 1.95e+00 0s 5 6.98908597e+02 -9.30960860e+02 1.09e-10 3.22e-15 8.55e-01 0s 6 4.14552498e+02 -8.46909829e+02 7.22e-11 3.29e-15 6.62e-01 0s 7 3.20694193e+02 -4.24850271e+02 5.06e-11 3.21e-15 3.91e-01 0s 8 1.95591481e+02 -1.97844619e+02 2.38e-11 2.41e-15 2.06e-01 0s 9 1.40732825e+02 -7.86052087e+00 7.52e-12 1.99e-15 7.79e-02 0s 10 1.26062743e+02 5.10904131e+01 4.08e-12 2.21e-15 3.93e-02 0s 11 1.20553605e+02 9.17429035e+01 3.75e-12 1.90e-15 1.51e-02 0s 12 1.11932175e+02 1.08768944e+02 9.85e-13 1.74e-15 1.66e-03 0s 13 1.11111867e+02 1.11106297e+02 9.26e-13 2.31e-15 2.92e-06 0s 14 1.11111112e+02 1.11111106e+02 1.03e-12 2.22e-15 2.92e-09 0s 15 1.11111111e+02 1.11111111e+02 1.68e-12 1.69e-15 3.53e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 561 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 34 881.00000 111.11111 87.4% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (1081 simplex iterations) in 0.08 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.04 seconds Gurobi run time: 0.08 seconds Total run time: 0.12 seconds Objective: 112 Solution: 1 x [2, 6, 6, 6, 6, 6, 7, 7, 10] 7 x [2, 2, 2, 2, 4, 5, 5, 9, 9] 8 x [2, 2, 2, 2, 2, 4, 7, 9, 9] 23 x [2, 2, 4, 4, 7, 8, 8, 9, 9] 1 x [2, 2, 2, 2, 4, 5] 16 x [1, 1, 4, 5, 5, 6, 6, 6, 6] 1 x [1, 3, 3, 3, 6, 6, 6, 6] 50 x [1, 3, 3, 3, 3, 6, 6, 6, 6] 1 x [1, 6, 6, 6, 6] 1 x [2, 4, 8, 8, 8, 8, 8, 8, 8] 3 x [2, 2, 2, 2, 2, 2, 4, 8, 8]