Build (method = -2) #dp: 6744 Step-3' Graph: 172 vertices and 564 arcs (0.03s) Step-4' Graph: 97 vertices and 414 arcs (0.03s) #V4/#V3 = 0.56 #A4/#A3 = 0.73 Ready! (0.03s) Optimize a model with 106 rows, 415 columns and 1064 nonzeros Presolve removed 23 rows and 47 columns Presolve time: 0.00s Presolved: 83 rows, 368 columns, 978 nonzeros Variable types: 0 continuous, 368 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 526.0000000 Optimize a model with 83 rows, 368 columns and 978 nonzeros Presolved: 83 rows, 368 columns, 978 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.160e+02 Factor NZ : 1.576e+03 Factor Ops : 3.371e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.21125917e+03 -6.30781061e+04 4.81e+04 2.22e-16 4.65e+02 0s 1 1.89513225e+03 -2.98743792e+04 8.65e+03 7.77e-16 9.74e+01 0s 2 9.47136334e+02 -9.55527204e+03 1.29e+03 6.11e-16 1.99e+01 0s 3 6.93275885e+02 -1.03963771e+03 1.95e-13 4.44e-15 2.33e+00 0s 4 2.74542977e+02 -3.00491150e+02 1.47e-13 1.33e-15 7.72e-01 0s 5 1.92412453e+02 -1.13979348e+02 9.33e-14 6.66e-16 4.11e-01 0s 6 1.16559648e+02 1.21753037e+00 1.31e-12 5.72e-16 1.55e-01 0s 7 1.09235638e+02 4.26302694e+01 1.09e-12 5.35e-16 8.94e-02 0s 8 1.03501049e+02 9.57974889e+01 6.29e-13 4.15e-16 1.03e-02 0s 9 1.00017307e+02 9.98960373e+01 4.52e-13 5.14e-16 1.63e-04 0s 10 1.00000017e+02 9.99998960e+01 7.79e-13 4.60e-16 1.63e-07 0s 11 1.00000000e+02 9.99999999e+01 6.43e-13 4.51e-16 1.63e-10 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.00000000e+02 Root relaxation: objective 1.000000e+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 100.00000 0 27 526.00000 100.00000 81.0% - 0s H 0 0 101.0000000 100.00000 0.99% - 0s 0 0 100.00000 0 18 101.00000 100.00000 0.99% - 0s Cutting planes: MIR: 1 Explored 0 nodes (578 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+02, best bound 1.000000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.04 seconds Total run time: 0.08 seconds Objective: 100 Solution: 48 x [2, 3, 4, 4, 5, 6, 7, 8, 9, 9] 16 x [1, 2, 3, 4, 4, 4, 4, 6, 7, 8] 24 x [1, 1, 2, 3, 4, 4, 5, 6, 8, 9] 1 x [3, 3, 3, 3, 3, 3, 4, 6, 8, 9] 3 x [3, 3, 3, 3, 3, 3, 3, 4, 4, 6] 7 x [1, 3, 3, 4, 4, 4, 4, 6, 6, 8] 1 x [2, 3, 3, 3, 3, 3, 3, 4, 8, 9]