Build (method = -2) #dp: 4404 Step-3' Graph: 146 vertices and 500 arcs (0.02s) Step-4' Graph: 92 vertices and 392 arcs (0.02s) #V4/#V3 = 0.63 #A4/#A3 = 0.78 Ready! (0.02s) Optimize a model with 102 rows, 393 columns and 1006 nonzeros Presolve removed 18 rows and 33 columns Presolve time: 0.00s Presolved: 84 rows, 360 columns, 948 nonzeros Variable types: 0 continuous, 360 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 825.0000000 Optimize a model with 84 rows, 360 columns and 948 nonzeros Presolved: 84 rows, 360 columns, 948 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.250e+02 Factor NZ : 1.695e+03 Factor Ops : 3.839e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.92568645e+03 -4.14486469e+04 4.11e+04 2.22e-16 3.63e+02 0s 1 1.58198104e+03 -1.90566282e+04 5.47e+03 6.66e-16 6.09e+01 0s 2 9.26858745e+02 -5.24123372e+03 8.00e+02 5.55e-16 1.16e+01 0s 3 5.58481131e+02 -1.15677887e+03 6.57e-01 6.66e-16 2.35e+00 0s 4 3.56659681e+02 -3.54075558e+02 3.09e-01 2.84e-16 9.74e-01 0s 5 2.22448468e+02 -1.16234951e+02 1.53e-01 2.65e-16 4.64e-01 0s 6 1.85660461e+02 -4.94726046e+01 9.01e-02 2.31e-16 3.22e-01 0s 7 1.41749796e+02 5.39633324e+01 3.04e-02 3.38e-16 1.20e-01 0s 8 1.32747959e+02 1.14245563e+02 1.64e-02 2.38e-16 2.54e-02 0s 9 1.25463773e+02 1.24204474e+02 8.14e-05 2.22e-16 1.73e-03 0s 10 1.25000513e+02 1.24999221e+02 3.37e-12 1.80e-16 1.77e-06 0s 11 1.25000001e+02 1.24999999e+02 3.56e-13 2.49e-16 1.77e-09 0s 12 1.25000000e+02 1.25000000e+02 2.96e-13 3.07e-16 1.77e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 223 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 5 825.00000 125.00000 84.8% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (299 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.02 seconds Total run time: 0.05 seconds Objective: 125 Solution: 42 x [4, 6, 7, 7, 7, 8, 8, 10] 19 x [1, 2, 5, 8, 9, 9, 9, 10] 24 x [3, 4, 4, 5, 6, 7, 10, 10] 2 x [1, 4, 4, 6, 8, 10, 10, 10] 9 x [2, 4, 6, 8, 10, 10, 10, 10] 6 x [1, 2, 6, 8, 10, 10, 10, 10] 21 x [2, 2, 4, 6, 7, 7, 7, 8] 1 x [1, 4, 4, 7, 7, 7, 7, 8] 1 x [3, 4, 4, 6, 7, 7, 7, 7]