Build (method = -2) #dp: 3074 Step-3' Graph: 149 vertices and 545 arcs (0.01s) Step-4' Graph: 93 vertices and 433 arcs (0.01s) #V4/#V3 = 0.62 #A4/#A3 = 0.79 Ready! (0.01s) Optimize a model with 103 rows, 434 columns and 1126 nonzeros Presolve removed 17 rows and 35 columns Presolve time: 0.00s Presolved: 86 rows, 399 columns, 1070 nonzeros Variable types: 0 continuous, 399 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 740.0000000 Optimize a model with 86 rows, 399 columns and 1070 nonzeros Presolved: 86 rows, 399 columns, 1070 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.200e+02 Factor NZ : 1.955e+03 Factor Ops : 5.038e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.42971497e+03 -5.72818349e+04 5.16e+04 1.11e-16 4.65e+02 0s 1 1.94658221e+03 -2.38954306e+04 6.77e+03 6.66e-16 7.31e+01 0s 2 1.06030743e+03 -7.27724581e+03 1.03e+03 7.77e-16 1.48e+01 0s 3 7.42941428e+02 -1.62806450e+03 4.55e-01 1.78e-15 2.94e+00 0s 4 4.11227614e+02 -7.87471168e+02 1.88e-01 6.66e-16 1.48e+00 0s 5 2.52165095e+02 -2.11960120e+02 8.85e-02 3.33e-16 5.75e-01 0s 6 1.89364983e+02 -2.37660554e+01 3.81e-02 2.98e-16 2.64e-01 0s 7 1.61773522e+02 8.59518879e+01 1.91e-02 2.50e-16 9.39e-02 0s 8 1.49605711e+02 1.30120341e+02 7.47e-03 2.31e-16 2.41e-02 0s 9 1.43178843e+02 1.42303789e+02 7.90e-13 3.33e-16 1.08e-03 0s 10 1.42857475e+02 1.42856592e+02 7.79e-13 3.33e-16 1.09e-06 0s 11 1.42857143e+02 1.42857143e+02 2.62e-12 2.38e-16 1.09e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 254 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 142.85714 0 29 740.00000 142.85714 80.7% - 0s H 0 0 145.0000000 142.85714 1.48% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s 0 0 142.85714 0 32 144.00000 142.85714 0.79% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (369 simplex iterations) in 0.04 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.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 143 Solution: 1 x [1, 1, 1, 1, 2, 8] 11 x [1, 1, 2, 5, 6, 6, 7] 4 x [1, 1, 2, 6, 6, 7, 7] 57 x [1, 1, 2, 2, 6, 7, 7] 1 x [1, 1, 1, 1, 2, 2, 6] 23 x [3, 4, 6, 7, 8, 9, 9] 2 x [4, 6, 8, 9, 9, 9, 10] 5 x [1, 1, 4, 5, 6, 7, 8] 31 x [3, 4, 8, 8, 8, 8, 10] 1 x [1, 8, 8, 8, 8, 9, 10] 2 x [1, 1, 5, 8, 8, 8, 8] 2 x [1, 1, 4, 6, 6, 7, 7] 3 x [1, 1, 4, 4, 4, 6, 6]