Build (method = -2) #dp: 3752 Step-3' Graph: 334 vertices and 1443 arcs (0.02s) Step-4' Graph: 273 vertices and 1321 arcs (0.02s) #V4/#V3 = 0.82 #A4/#A3 = 0.92 Ready! (0.02s) Optimize a model with 283 rows, 1322 columns and 3433 nonzeros Presolve removed 57 rows and 100 columns Presolve time: 0.02s Presolved: 226 rows, 1222 columns, 3335 nonzeros Variable types: 0 continuous, 1222 integer (0 binary) Found heuristic solution: objective 89.0000000 Optimize a model with 226 rows, 1222 columns and 3335 nonzeros Presolved: 226 rows, 1222 columns, 3335 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.880e+03 Factor NZ : 7.571e+03 Factor Ops : 3.541e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.11737726e+02 -2.19460636e+04 2.18e+04 1.11e-16 7.82e+01 0s 1 2.47169815e+02 -1.29283004e+04 2.99e+03 8.88e-16 1.38e+01 0s 2 1.58361098e+02 -5.30737880e+03 8.91e+02 4.00e-15 4.30e+00 0s 3 1.11267421e+02 -1.48986917e+03 1.72e+02 2.31e-14 9.73e-01 0s 4 1.01307804e+02 -2.77574322e+02 2.74e+01 6.44e-15 1.85e-01 0s 5 9.69265279e+01 -1.44997748e+02 5.22e-02 4.22e-15 9.87e-02 0s 6 7.15178336e+01 -1.51437763e+02 3.38e-02 3.89e-15 9.09e-02 0s 7 7.79731807e+01 -9.90018713e+01 2.93e-02 2.89e-15 7.22e-02 0s 8 5.97656595e+01 -4.57603478e+01 2.07e-02 1.11e-15 4.30e-02 0s 9 4.03036729e+01 -1.86246369e+01 1.18e-02 3.33e-16 2.40e-02 0s 10 2.35655657e+01 -8.39124997e+00 5.75e-03 3.34e-16 1.30e-02 0s 11 1.85702755e+01 -3.84471981e+00 4.19e-03 3.33e-16 9.14e-03 0s 12 1.57629146e+01 8.06336002e-01 3.08e-03 3.12e-16 6.10e-03 0s 13 1.51869068e+01 2.89958136e+00 2.80e-03 3.76e-16 5.01e-03 0s 14 1.28344706e+01 5.45828419e+00 1.62e-03 3.52e-16 3.01e-03 0s 15 1.19165783e+01 9.14488818e+00 5.34e-04 2.97e-16 1.13e-03 0s 16 1.11145141e+01 1.00288987e+01 1.02e-04 2.63e-16 4.43e-04 0s 17 1.09197086e+01 1.04302966e+01 3.85e-05 2.45e-16 2.00e-04 0s 18 1.08209368e+01 1.06237375e+01 1.15e-05 2.40e-16 8.04e-05 0s 19 1.07938667e+01 1.06885154e+01 7.06e-06 3.50e-16 4.29e-05 0s 20 1.07681683e+01 1.07172356e+01 3.26e-06 2.54e-16 2.08e-05 0s 21 1.07506023e+01 1.07302020e+01 9.48e-07 4.54e-16 8.32e-06 0s 22 1.07435714e+01 1.07399685e+01 1.38e-07 3.51e-16 1.47e-06 0s 23 1.07420302e+01 1.07419390e+01 2.13e-09 3.16e-16 3.72e-08 0s 24 1.07420000e+01 1.07419999e+01 8.99e-14 2.45e-16 3.72e-11 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.07420000e+01 Root relaxation: objective 1.074200e+01, 243 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.74200 0 36 89.00000 10.74200 87.9% - 0s H 0 0 12.0000000 10.74200 10.5% - 0s H 0 0 11.0000000 10.74200 2.35% - 0s Explored 0 nodes (556 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 11 Solution: 1 x [1, 1, 2, 5, 9, 9, 9, 9, 9] 3 x [4, 4, 4, 6, 7, 7, 8, 8, 8] 1 x [4, 4, 4, 4, 6, 6, 9, 10] 1 x [3, 3, 4, 4, 5, 7, 8, 9, 10] 3 x [3, 3, 4, 4, 5, 7, 9, 10, 10, 10] 1 x [3, 3, 4, 4, 5, 7, 7, 9] 1 x [4, 5, 5, 7, 7, 7, 7, 7, 7]