Build (method = -2) #dp: 2362 Step-3' Graph: 155 vertices and 555 arcs (0.01s) Step-4' Graph: 106 vertices and 457 arcs (0.01s) #V4/#V3 = 0.68 #A4/#A3 = 0.82 Ready! (0.01s) Optimize a model with 115 rows, 458 columns and 1173 nonzeros Presolve removed 38 rows and 74 columns Presolve time: 0.00s Presolved: 77 rows, 384 columns, 1055 nonzeros Variable types: 0 continuous, 384 integer (0 binary) Found heuristic solution: objective 996.0000000 Found heuristic solution: objective 923.0000000 Found heuristic solution: objective 627.0000000 Optimize a model with 77 rows, 384 columns and 1055 nonzeros Presolved: 77 rows, 384 columns, 1055 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.620e+02 Factor NZ : 1.657e+03 Factor Ops : 4.142e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.59022761e+03 -5.92267457e+04 3.75e+04 2.22e-16 4.01e+02 0s 1 1.87037090e+03 -2.50450309e+04 5.83e+03 5.55e-16 7.46e+01 0s 2 1.07705505e+03 -6.31960749e+03 8.36e+02 9.99e-16 1.33e+01 0s 3 7.75048930e+02 -2.17934722e+03 1.29e+00 6.66e-16 3.81e+00 0s 4 3.49427640e+02 -1.02498895e+03 1.74e-03 8.88e-16 1.77e+00 0s 5 2.14390667e+02 -3.77809468e+02 8.58e-04 2.79e-16 7.62e-01 0s 6 1.58131328e+02 -4.66047063e+01 3.60e-04 2.22e-16 2.63e-01 0s 7 1.38288454e+02 6.92446918e+01 1.77e-04 2.35e-16 8.89e-02 0s 8 1.32266173e+02 1.16862040e+02 8.40e-05 1.89e-16 1.98e-02 0s 9 1.25457510e+02 1.23055857e+02 5.97e-06 1.90e-16 3.09e-03 0s 10 1.25000473e+02 1.24998062e+02 2.50e-12 4.44e-16 3.10e-06 0s 11 1.25000000e+02 1.24999998e+02 2.85e-12 1.75e-16 3.10e-09 0s 12 1.25000000e+02 1.25000000e+02 3.57e-12 1.73e-16 3.10e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 225 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 18 627.00000 125.00000 80.1% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 17 126.00000 125.00000 0.79% - 0s 0 0 125.00000 0 6 126.00000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (858 simplex iterations) in 0.05 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.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 125 Solution: 3 x [3, 4, 5, 6, 6, 6, 7, 8] 28 x [2, 4, 5, 5, 7, 7, 8, 9] 12 x [4, 5, 5, 5, 6, 8, 8, 8] 30 x [1, 2, 3, 4, 4, 5, 7, 8] 6 x [4, 4, 5, 7, 7, 8, 8, 8] 19 x [3, 4, 4, 5, 5, 6, 8, 9] 1 x [4, 4, 4, 5, 5, 8, 8, 8] 1 x [4, 4, 4, 4, 5, 8, 8, 8] 25 x [2, 3, 6, 7, 7, 7, 7, 8]