Build (method = -2) #dp: 2751 Step-3' Graph: 152 vertices and 535 arcs (0.01s) Step-4' Graph: 101 vertices and 433 arcs (0.01s) #V4/#V3 = 0.66 #A4/#A3 = 0.81 Ready! (0.01s) Optimize a model with 111 rows, 434 columns and 1110 nonzeros Presolve removed 31 rows and 56 columns Presolve time: 0.00s Presolved: 80 rows, 378 columns, 1029 nonzeros Variable types: 0 continuous, 378 integer (0 binary) Found heuristic solution: objective 1000.0000000 Found heuristic solution: objective 649.0000000 Optimize a model with 80 rows, 378 columns and 1029 nonzeros Presolved: 80 rows, 378 columns, 1029 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.840e+02 Factor NZ : 1.653e+03 Factor Ops : 3.877e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.47417253e+03 -5.04088332e+04 3.47e+04 2.22e-16 3.20e+02 0s 1 1.69087567e+03 -2.02838021e+04 5.32e+03 1.33e-15 5.86e+01 0s 2 1.01684888e+03 -5.13748500e+03 7.69e+02 7.77e-16 1.10e+01 0s 3 5.80439838e+02 -1.32478327e+03 2.64e+00 9.44e-16 2.49e+00 0s 4 3.51895095e+02 -5.87275483e+02 1.13e+00 1.17e-15 1.23e+00 0s 5 2.22993479e+02 -3.37302335e+02 4.72e-01 8.88e-16 7.32e-01 0s 6 1.82886878e+02 -5.15656989e+01 2.82e-01 4.66e-16 3.06e-01 0s 7 1.56519639e+02 3.30407867e+01 1.33e-01 5.27e-16 1.61e-01 0s 8 1.44261376e+02 1.33642209e+02 1.61e-03 5.55e-16 1.39e-02 0s 9 1.42865556e+02 1.42810304e+02 2.52e-13 6.66e-16 7.21e-05 0s 10 1.42857151e+02 1.42857096e+02 5.95e-13 8.88e-16 7.21e-08 0s 11 1.42857143e+02 1.42857143e+02 2.65e-13 9.00e-16 7.21e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 230 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 28 649.00000 142.85714 78.0% - 0s H 0 0 145.0000000 142.85714 1.48% - 0s 0 0 142.85714 0 29 145.00000 142.85714 1.48% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s 0 0 142.85714 0 37 144.00000 142.85714 0.79% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (429 simplex iterations) in 0.05 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.05 seconds Total run time: 0.07 seconds Objective: 143 Solution: 1 x [1, 2, 4, 4, 7, 8, 10] 36 x [1, 3, 4, 7, 8, 10, 10] 15 x [1, 4, 4, 7, 7, 8, 10] 40 x [1, 2, 4, 6, 6, 6, 8] 1 x [4, 4, 5, 7, 8, 9, 10] 1 x [2, 7, 7, 8, 9, 9] 30 x [4, 7, 7, 8, 8, 9, 10] 1 x [2, 6, 8, 10, 10, 10, 10] 5 x [2, 2, 8, 9, 10, 10, 10] 6 x [5, 5, 5, 5, 5, 8, 10] 3 x [5, 5, 6, 8, 10, 10, 10] 4 x [4, 8, 8, 9, 9, 9, 9]