Build (method = -2) #dp: 3369 Step-3' Graph: 255 vertices and 1043 arcs (0.02s) Step-4' Graph: 186 vertices and 905 arcs (0.02s) #V4/#V3 = 0.73 #A4/#A3 = 0.87 Ready! (0.02s) Optimize a model with 196 rows, 906 columns and 2356 nonzeros Presolve removed 41 rows and 77 columns Presolve time: 0.01s Presolved: 155 rows, 829 columns, 2255 nonzeros Variable types: 0 continuous, 829 integer (0 binary) Found heuristic solution: objective 75.0000000 Optimize a model with 155 rows, 829 columns and 2255 nonzeros Presolved: 155 rows, 829 columns, 2255 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.234e+03 Factor NZ : 3.890e+03 Factor Ops : 1.175e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.68588906e+02 -1.82884502e+04 1.41e+04 2.22e-16 6.91e+01 0s 1 3.25760514e+02 -9.05548492e+03 2.47e+03 2.33e-14 1.43e+01 0s 2 1.88487599e+02 -3.26321028e+03 5.10e+02 1.36e-14 3.49e+00 0s 3 1.52054374e+02 -8.51384079e+02 2.98e+01 1.35e-14 6.58e-01 0s 4 1.11133389e+02 -3.05432979e+02 1.98e-02 1.24e-14 2.50e-01 0s 5 8.92369182e+01 -1.20887037e+02 1.24e-02 1.31e-14 1.26e-01 0s 6 7.46533598e+01 -8.61898859e+01 9.64e-03 1.45e-14 9.64e-02 0s 7 3.49924507e+01 -3.48448399e+01 4.21e-03 1.18e-14 4.19e-02 0s 8 2.19007458e+01 -9.00621493e+00 1.70e-03 7.87e-15 1.85e-02 0s 9 1.74881519e+01 -1.46632123e+00 1.11e-03 1.05e-14 1.14e-02 0s 10 1.51266353e+01 5.91443427e+00 5.11e-04 1.10e-14 5.52e-03 0s 11 1.29280763e+01 1.09075556e+01 4.14e-05 7.00e-15 1.21e-03 0s 12 1.25400329e+01 1.22874387e+01 2.69e-06 7.08e-15 1.51e-04 0s 13 1.25001537e+01 1.24986972e+01 1.47e-08 6.78e-15 8.73e-07 0s 14 1.25000000e+01 1.25000000e+01 1.23e-13 9.51e-15 9.11e-13 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 450 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 41 75.00000 12.50000 83.3% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (725 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.09 seconds Objective: 13 Solution: 2 x [2, 4, 5, 5, 6, 6, 7, 8] 1 x [2, 4, 5, 6, 7, 9] 1 x [2, 4, 5, 5, 6, 6, 7] 3 x [3, 4, 4, 5, 8, 8, 9, 10] 1 x [1, 1, 1, 3, 9, 9, 9] 4 x [1, 1, 1, 3, 3, 10, 10, 10] 1 x [2, 2, 2, 2, 2, 2, 10, 10]