Build (method = -2) #dp: 1580 Step-3' Graph: 117 vertices and 381 arcs (0.01s) Step-4' Graph: 76 vertices and 299 arcs (0.01s) #V4/#V3 = 0.65 #A4/#A3 = 0.78 Ready! (0.01s) Optimize a model with 85 rows, 300 columns and 758 nonzeros Presolve removed 20 rows and 41 columns Presolve time: 0.00s Presolved: 65 rows, 259 columns, 683 nonzeros Variable types: 0 continuous, 259 integer (9 binary) Found heuristic solution: objective 997.0000000 Found heuristic solution: objective 519.0000000 Optimize a model with 65 rows, 259 columns and 683 nonzeros Presolved: 65 rows, 259 columns, 683 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.890e+02 Factor NZ : 1.178e+03 Factor Ops : 2.432e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.24277560e+03 -3.80988938e+04 4.30e+04 1.27e-01 5.29e+02 0s 1 2.48078665e+03 -1.79615152e+04 7.86e+03 3.33e-16 1.04e+02 0s 2 1.04426727e+03 -4.89369930e+03 7.52e+02 6.11e-16 1.57e+01 0s 3 5.33233595e+02 -1.42519432e+03 2.29e+01 4.44e-16 3.81e+00 0s 4 2.59347784e+02 -2.33205469e+02 7.95e+00 3.89e-16 9.55e-01 0s 5 1.78170161e+02 -1.92387293e+01 3.61e+00 2.01e-16 3.82e-01 0s 6 1.63534295e+02 5.48186376e+01 1.83e+00 1.82e-16 2.09e-01 0s 7 1.52909286e+02 1.14805113e+02 7.48e-01 2.22e-16 7.32e-02 0s 8 1.43254689e+02 1.41262593e+02 3.33e-03 1.38e-16 3.79e-03 0s 9 1.42859566e+02 1.42842393e+02 2.67e-13 3.33e-16 3.26e-05 0s 10 1.42857145e+02 1.42857128e+02 7.43e-12 2.14e-16 3.26e-08 0s 11 1.42857143e+02 1.42857143e+02 1.57e-13 3.03e-16 3.26e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 157 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 142.85714 0 20 519.00000 142.85714 72.5% - 0s H 0 0 145.0000000 142.85714 1.48% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Explored 0 nodes (253 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.430000000000e+02, best bound 1.430000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 143 Solution: 9 x [2, 3, 7, 7, 7, 7, 8] 40 x [3, 3, 3, 4, 4, 7, 8] 1 x [2, 3, 7, 9, 9, 9] 49 x [2, 3, 7, 9, 9, 9, 9] 25 x [1, 1, 1, 2, 3, 7, 7] 1 x [2, 3, 6, 7, 7, 7, 7] 1 x [2, 3, 7, 7, 7, 7, 7] 4 x [2, 2, 3, 3, 5, 7, 7] 12 x [2, 2, 3, 3, 7, 7, 7] 1 x [2, 2, 3, 3, 3, 7, 7]