Build (method = -2) #dp: 257 Step-3' Graph: 50 vertices and 174 arcs (0.00s) Step-4' Graph: 32 vertices and 138 arcs (0.00s) #V4/#V3 = 0.64 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 39 rows, 139 columns and 362 nonzeros Presolve removed 6 rows and 11 columns Presolve time: 0.00s Presolved: 33 rows, 128 columns, 342 nonzeros Variable types: 0 continuous, 128 integer (0 binary) Found heuristic solution: objective 329.0000000 Found heuristic solution: objective 324.0000000 Optimize a model with 33 rows, 128 columns and 342 nonzeros Presolved: 33 rows, 128 columns, 342 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.830e+02 Factor NZ : 4.280e+02 Factor Ops : 6.820e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.85456727e+03 -5.34875667e+03 5.97e+03 2.22e-16 1.30e+02 0s 1 5.14440076e+02 -2.08724803e+03 8.56e+02 3.33e-16 2.20e+01 0s 2 1.71164313e+02 -3.21644049e+02 4.13e+01 9.77e-15 2.32e+00 0s 3 1.03660642e+02 -5.23660520e+01 1.96e+01 1.44e-15 7.04e-01 0s 4 1.07315644e+02 1.53034328e+01 5.98e+00 4.44e-16 3.72e-01 0s 5 7.41488151e+01 4.52864339e+01 2.25e+00 1.11e-16 1.16e-01 0s 6 6.56796639e+01 4.80971121e+01 1.33e+00 1.46e-16 6.99e-02 0s 7 5.91543213e+01 5.35237811e+01 2.96e-01 1.11e-16 2.19e-02 0s 8 5.72930485e+01 5.61254643e+01 4.04e-02 1.83e-16 4.49e-03 0s 9 5.69210360e+01 5.65683258e+01 9.50e-03 2.21e-16 1.35e-03 0s 10 5.68030552e+01 5.67962658e+01 1.35e-04 1.11e-16 2.60e-05 0s 11 5.68000001e+01 5.67999998e+01 4.08e-09 1.88e-16 1.02e-09 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 5.68000001e+01 Root relaxation: objective 5.680000e+01, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 56.80000 0 7 324.00000 56.80000 82.5% - 0s H 0 0 57.0000000 56.80000 0.35% - 0s Explored 0 nodes (30 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.700000000000e+01, best bound 5.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 57 Solution: 1 x [2, 4, 6, 6, 7] 2 x [2, 4, 4, 5, 5] 6 x [2, 4, 4, 4, 7] 3 x [2, 2, 2, 6, 7] 4 x [1, 3, 4, 4, 6, 6] 2 x [1, 4, 4, 4, 6, 6] 39 x [4, 4, 4, 4, 6, 6]