Build (method = -2) #dp: 1169 Step-3' Graph: 110 vertices and 355 arcs (0.00s) Step-4' Graph: 68 vertices and 271 arcs (0.01s) #V4/#V3 = 0.62 #A4/#A3 = 0.76 Ready! (0.01s) Optimize a model with 77 rows, 272 columns and 690 nonzeros Presolve removed 15 rows and 31 columns Presolve time: 0.00s Presolved: 62 rows, 241 columns, 633 nonzeros Variable types: 0 continuous, 241 integer (24 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 86.0000000 Optimize a model with 62 rows, 241 columns and 633 nonzeros Presolved: 62 rows, 241 columns, 633 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.590e+02 Factor NZ : 1.030e+03 Factor Ops : 1.917e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.76970824e+02 -3.98251460e+03 3.76e+03 1.35e-01 5.26e+01 0s 1 2.32667276e+02 -1.80558431e+03 6.92e+02 6.66e-16 1.03e+01 0s 2 1.03468555e+02 -5.51783163e+02 6.02e+01 4.44e-16 1.71e+00 0s 3 5.66216379e+01 -1.39423602e+02 3.00e+00 3.19e-16 4.11e-01 0s 4 3.84969792e+01 -2.72392485e+01 1.58e+00 2.43e-16 1.38e-01 0s 5 2.26127525e+01 -5.29729020e+00 7.38e-01 1.71e-16 5.85e-02 0s 6 1.71126059e+01 5.44874934e+00 3.81e-01 2.22e-16 2.44e-02 0s 7 1.62076555e+01 1.03837320e+01 2.01e-01 1.64e-16 1.21e-02 0s 8 1.44498396e+01 1.37631772e+01 9.10e-14 2.15e-16 1.40e-03 0s 9 1.42861011e+01 1.42797488e+01 2.00e-14 2.22e-16 1.30e-05 0s 10 1.42857147e+01 1.42857083e+01 1.57e-13 2.22e-16 1.30e-08 0s 11 1.42857143e+01 1.42857143e+01 3.26e-14 1.85e-16 1.30e-11 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 145 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 19 86.00000 14.28571 83.4% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (207 simplex iterations) in 0.01 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.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 15 Solution: 1 x [3, 3, 6, 7, 7, 8] 4 x [2, 2, 3, 3, 3, 7, 8] 1 x [2, 3, 4, 7, 9, 9] 3 x [1, 2, 3, 3, 4, 7, 9] 1 x [3, 3, 3, 4, 7, 7] 1 x [4, 5, 7, 9, 9, 9] 3 x [7, 7, 7, 9, 9, 9, 9] 1 x [1, 1, 1, 1, 4, 7]