Build (method = -2) #dp: 907 Step-3' Graph: 163 vertices and 563 arcs (0.00s) Step-4' Graph: 118 vertices and 473 arcs (0.00s) #V4/#V3 = 0.72 #A4/#A3 = 0.84 Ready! (0.00s) Optimize a model with 125 rows, 474 columns and 1198 nonzeros Presolve removed 30 rows and 57 columns Presolve time: 0.00s Presolved: 95 rows, 417 columns, 1102 nonzeros Variable types: 0 continuous, 417 integer (0 binary) Found heuristic solution: objective 343.0000000 Optimize a model with 95 rows, 417 columns and 1102 nonzeros Presolved: 95 rows, 417 columns, 1102 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.000e+02 Factor NZ : 1.985e+03 Factor Ops : 4.733e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.27000838e+03 -3.09178021e+04 3.59e+04 2.22e-16 3.13e+02 0s 1 1.03619508e+03 -1.28071553e+04 5.92e+03 5.55e-16 5.51e+01 0s 2 5.21570251e+02 -3.59792743e+03 1.28e+03 8.88e-16 1.22e+01 0s 3 3.43396900e+02 -8.90929032e+02 7.13e+01 7.77e-15 1.75e+00 0s 4 1.79917821e+02 -2.63284397e+02 6.73e+00 1.22e-15 5.45e-01 0s 5 9.02171643e+01 -1.06411017e+02 1.62e+00 6.66e-16 2.37e-01 0s 6 9.43561531e+01 -6.42068344e+01 1.36e+00 5.55e-16 1.91e-01 0s 7 7.63990933e+01 -1.53106228e+01 9.97e-01 5.55e-16 1.10e-01 0s 8 6.71698081e+01 2.90697606e+00 7.35e-01 2.22e-16 7.73e-02 0s 9 5.07765545e+01 2.38059794e+01 2.51e-01 3.33e-16 3.23e-02 0s 10 4.43475793e+01 2.96261927e+01 1.14e-01 2.22e-16 1.76e-02 0s 11 4.32658033e+01 3.30234452e+01 8.12e-02 2.22e-16 1.22e-02 0s 12 4.05745048e+01 3.68897210e+01 2.61e-02 2.85e-16 4.40e-03 0s 13 3.95682356e+01 3.87885467e+01 4.66e-03 2.22e-16 9.30e-04 0s 14 3.93346071e+01 3.93309057e+01 4.94e-06 3.06e-16 4.40e-06 0s 15 3.93333333e+01 3.93333333e+01 8.74e-12 2.83e-16 5.74e-12 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 3.93333333e+01 Root relaxation: objective 3.933333e+01, 230 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 39.33333 0 23 343.00000 39.33333 88.5% - 0s H 0 0 43.0000000 39.33333 8.53% - 0s H 0 0 41.0000000 39.33333 4.07% - 0s 0 0 39.33333 0 30 41.00000 39.33333 4.07% - 0s H 0 0 40.0000000 39.33333 1.67% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (328 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.04 seconds Total run time: 0.05 seconds Objective: 40 Solution: 3 x [3, 3, 3, 4, 6, 6, 6, 6, 6] 2 x [2, 2, 3, 5, 6, 6, 6, 6, 7] 1 x [1, 5, 6, 6, 6, 6, 7] 5 x [1, 3, 3, 3, 3, 3, 7, 7, 7] 1 x [3, 3, 3, 5, 5, 6, 6, 6] 1 x [5, 5, 5, 6, 6, 6] 19 x [3, 3, 3, 3, 3, 3, 3, 7, 7] 8 x [3, 3, 3, 3, 3, 3, 3, 3, 3]