Build (method = -2) #dp: 4757 Step-3' Graph: 380 vertices and 1601 arcs (0.02s) Step-4' Graph: 311 vertices and 1463 arcs (0.03s) #V4/#V3 = 0.82 #A4/#A3 = 0.91 Ready! (0.03s) Optimize a model with 321 rows, 1464 columns and 3782 nonzeros Presolve removed 80 rows and 152 columns Presolve time: 0.02s Presolved: 241 rows, 1312 columns, 3604 nonzeros Variable types: 0 continuous, 1312 integer (0 binary) Found heuristic solution: objective 905.0000000 Optimize a model with 241 rows, 1312 columns and 3604 nonzeros Presolved: 241 rows, 1312 columns, 3604 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.048e+03 Factor NZ : 7.404e+03 Factor Ops : 2.939e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.86828286e+03 -1.86923162e+05 1.73e+05 1.11e-16 5.75e+02 0s 1 2.59765855e+03 -1.06567141e+05 3.25e+04 5.55e-16 1.25e+02 0s 2 1.45802972e+03 -4.25853370e+04 8.52e+03 3.77e-15 3.53e+01 0s 3 1.05839271e+03 -1.07266182e+04 1.33e+03 7.33e-15 6.71e+00 0s 4 9.75911932e+02 -1.90235216e+03 8.42e+01 1.67e-15 1.18e+00 0s 5 7.03148881e+02 -1.08201844e+03 7.13e-12 8.88e-16 6.78e-01 0s 6 5.69035122e+02 -6.76076748e+02 5.14e-12 5.55e-16 4.73e-01 0s 7 4.29846161e+02 -3.27471744e+02 3.68e-12 5.55e-16 2.88e-01 0s 8 3.02414901e+02 -1.82054555e+02 2.42e-12 4.44e-16 1.84e-01 0s 9 1.86824093e+02 -5.74584460e+01 1.06e-12 3.09e-16 9.27e-02 0s 10 1.60853331e+02 -9.26430009e+00 7.71e-13 3.41e-16 6.46e-02 0s 11 1.45186373e+02 3.63540130e+01 1.02e-12 4.44e-16 4.13e-02 0s 12 1.34758692e+02 6.30225516e+01 3.91e-12 3.34e-16 2.72e-02 0s 13 1.24934183e+02 8.54191009e+01 2.09e-12 2.89e-16 1.50e-02 0s 14 1.20256249e+02 9.90314569e+01 1.19e-12 3.33e-16 8.06e-03 0s 15 1.14914831e+02 1.06243056e+02 8.24e-12 3.26e-16 3.29e-03 0s 16 1.12684355e+02 1.08590438e+02 3.36e-12 3.13e-16 1.55e-03 0s 17 1.11377519e+02 1.10723809e+02 2.27e-11 2.39e-16 2.48e-04 0s 18 1.11111704e+02 1.11106222e+02 5.88e-11 3.15e-16 2.08e-06 0s 19 1.11111111e+02 1.11111111e+02 5.90e-11 2.79e-16 5.76e-12 0s Barrier solved model in 19 iterations and 0.02 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 766 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 28 905.00000 111.11111 87.7% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (1291 simplex iterations) in 0.10 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.10 seconds Total run time: 0.14 seconds Objective: 112 Solution: 3 x [4, 5, 5, 5, 5, 7, 7, 7, 8] 34 x [3, 3, 3, 5, 6, 6, 7, 7, 8] 20 x [1, 1, 1, 4, 7, 7, 8, 8, 9] 12 x [6, 7, 7, 7, 7, 7, 8, 8, 10] 1 x [7, 7, 7, 7, 7, 8, 8, 10] 1 x [3, 3, 3, 7, 7, 8, 8] 1 x [3, 3, 3, 3, 5, 7, 7, 8, 8] 14 x [3, 3, 3, 4, 4, 5, 6, 7, 7] 25 x [2, 3, 5, 5, 5, 5, 6, 6, 6] 1 x [1, 1, 7, 9]