Build (method = -2) #dp: 2614 Step-3' Graph: 150 vertices and 547 arcs (0.01s) Step-4' Graph: 112 vertices and 471 arcs (0.01s) #V4/#V3 = 0.75 #A4/#A3 = 0.86 Ready! (0.01s) Optimize a model with 122 rows, 472 columns and 1197 nonzeros Presolve removed 21 rows and 44 columns Presolve time: 0.00s Presolved: 101 rows, 428 columns, 1123 nonzeros Variable types: 0 continuous, 428 integer (0 binary) Found heuristic solution: objective 80.0000000 Found heuristic solution: objective 62.0000000 Optimize a model with 101 rows, 428 columns and 1123 nonzeros Presolved: 101 rows, 428 columns, 1123 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.680e+02 Factor NZ : 2.237e+03 Factor Ops : 5.672e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.44468678e+02 -9.55409427e+03 8.09e+03 2.22e-16 7.15e+01 0s 1 2.68242699e+02 -4.63527484e+03 1.18e+03 6.66e-16 1.30e+01 0s 2 1.49698275e+02 -1.37877445e+03 2.15e+02 3.66e-15 2.73e+00 0s 3 1.06722248e+02 -1.78022771e+02 3.91e-14 1.83e-15 3.29e-01 0s 4 5.77205965e+01 -7.89019137e+01 3.43e-14 2.02e-15 1.58e-01 0s 5 4.10729839e+01 -3.28616695e+01 2.04e-14 1.92e-15 8.54e-02 0s 6 2.41961183e+01 -1.92970308e+01 1.58e-14 2.34e-15 5.02e-02 0s 7 1.84953829e+01 -4.28127987e+00 1.55e-14 2.45e-15 2.63e-02 0s 8 1.67174276e+01 6.70730124e+00 1.13e-14 1.78e-15 1.16e-02 0s 9 1.50744132e+01 1.17902921e+01 1.08e-14 1.88e-15 3.79e-03 0s 10 1.43469939e+01 1.41281160e+01 1.23e-13 1.68e-15 2.53e-04 0s 11 1.42857951e+01 1.42851845e+01 3.67e-13 2.04e-15 7.05e-07 0s 12 1.42857144e+01 1.42857138e+01 6.42e-14 2.64e-15 7.05e-10 0s 13 1.42857143e+01 1.42857143e+01 3.85e-13 2.24e-15 7.23e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 244 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 29 62.00000 14.28571 77.0% - 0s H 0 0 16.0000000 14.28571 10.7% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (396 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 15 Solution: 2 x [1, 2, 4, 5, 9, 10, 10] 1 x [2, 3, 5, 5, 7, 7] 1 x [1, 4, 5, 6, 6, 7, 7] 1 x [1, 1, 6, 7, 7] 4 x [1, 1, 6, 6, 7, 9, 9] 1 x [1, 1, 3, 7, 7] 2 x [4, 4, 5, 5, 5, 7, 7] 3 x [4, 4, 6, 7, 8, 8, 8]