Build (method = -2) #dp: 4803 Step-3' Graph: 181 vertices and 591 arcs (0.03s) Step-4' Graph: 110 vertices and 449 arcs (0.03s) #V4/#V3 = 0.61 #A4/#A3 = 0.76 Ready! (0.03s) Optimize a model with 119 rows, 450 columns and 1142 nonzeros Presolve removed 29 rows and 60 columns Presolve time: 0.00s Presolved: 90 rows, 390 columns, 1038 nonzeros Variable types: 0 continuous, 390 integer (0 binary) Found heuristic solution: objective 70.0000000 Optimize a model with 90 rows, 390 columns and 1038 nonzeros Presolved: 90 rows, 390 columns, 1038 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.790e+02 Factor NZ : 1.731e+03 Factor Ops : 3.761e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.33626729e+02 -6.87721811e+03 5.27e+03 2.22e-16 4.88e+01 0s 1 2.09221763e+02 -2.77711862e+03 8.33e+02 1.17e-15 8.68e+00 0s 2 1.08114259e+02 -8.09487451e+02 1.25e+02 5.00e-16 1.67e+00 0s 3 7.85816140e+01 -9.89144820e+01 1.03e-13 7.77e-16 2.25e-01 0s 4 3.59101709e+01 -2.60376726e+01 2.89e-14 3.33e-16 7.85e-02 0s 5 1.86546983e+01 -8.36682961e+00 1.41e-14 2.39e-16 3.42e-02 0s 6 1.40744877e+01 1.83130332e+00 1.49e-14 2.22e-16 1.55e-02 0s 7 1.25694805e+01 7.64764176e+00 5.32e-14 2.61e-16 6.24e-03 0s 8 1.11748260e+01 1.07968377e+01 3.06e-13 2.13e-16 4.79e-04 0s 9 1.11112402e+01 1.11103466e+01 1.85e-13 2.07e-16 1.13e-06 0s 10 1.11111112e+01 1.11111103e+01 5.02e-14 2.92e-16 1.13e-09 0s 11 1.11111111e+01 1.11111111e+01 9.42e-14 1.93e-16 1.13e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 224 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 34 70.00000 11.11111 84.1% - 0s H 0 0 14.0000000 11.11111 20.6% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (340 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.02 seconds Total run time: 0.06 seconds Objective: 12 Solution: 2 x [1, 3, 3, 5, 5, 6, 7, 8, 8] 2 x [1, 1, 2, 3, 4, 6, 7, 9, 9] 3 x [1, 1, 1, 2, 3, 4, 6, 7, 9] 1 x [2, 2, 3, 3, 5, 5, 6, 7] 1 x [2, 2, 3, 3, 5, 5, 5, 6, 7] 1 x [6, 6, 6, 6, 6, 6, 8, 8, 8] 1 x [1, 1, 1, 4, 8, 9] 1 x [3, 8, 8, 8, 8]