Build (method = -2) #dp: 3002 Step-3' Graph: 123 vertices and 492 arcs (0.01s) Step-4' Graph: 85 vertices and 416 arcs (0.01s) #V4/#V3 = 0.69 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 95 rows, 417 columns and 1087 nonzeros Presolve removed 19 rows and 33 columns Presolve time: 0.00s Presolved: 76 rows, 384 columns, 1041 nonzeros Variable types: 0 continuous, 384 integer (0 binary) Found heuristic solution: objective 89.0000000 Optimize a model with 76 rows, 384 columns and 1041 nonzeros Presolved: 76 rows, 384 columns, 1041 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.710e+02 Factor NZ : 1.707e+03 Factor Ops : 4.696e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.13270144e+02 -9.18161243e+03 6.88e+03 2.22e-16 7.90e+01 0s 1 2.55920961e+02 -3.71786468e+03 8.98e+02 1.11e-15 1.24e+01 0s 2 1.22283981e+02 -1.22371490e+03 1.35e+02 1.89e-15 2.54e+00 0s 3 8.66388228e+01 -2.20898479e+02 8.08e+00 3.11e-15 4.20e-01 0s 4 4.33779363e+01 -7.72520039e+01 4.63e-01 1.33e-15 1.56e-01 0s 5 3.42489261e+01 -4.72100247e+01 2.94e-01 8.88e-16 1.05e-01 0s 6 2.41208541e+01 -2.04772807e+01 1.67e-01 5.55e-16 5.76e-02 0s 7 1.69850548e+01 1.67072553e+00 7.34e-02 3.39e-16 1.98e-02 0s 8 1.63957761e+01 1.09805393e+01 2.44e-02 2.55e-16 6.97e-03 0s 9 1.44582401e+01 1.39908696e+01 2.00e-03 3.05e-16 6.02e-04 0s 10 1.42859306e+01 1.42853786e+01 8.04e-14 3.25e-16 7.09e-07 0s 11 1.42857145e+01 1.42857140e+01 6.65e-14 2.80e-16 7.09e-10 0s 12 1.42857143e+01 1.42857143e+01 1.99e-14 3.62e-16 7.09e-13 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 201 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 12 89.00000 14.28571 83.9% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (405 simplex iterations) in 0.02 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.02 seconds Total run time: 0.04 seconds Objective: 15 Solution: 3 x [1, 2, 5, 6, 7, 7, 10] 5 x [1, 2, 3, 3, 5, 7, 8] 2 x [1, 3, 3, 3, 5, 7, 8] 1 x [1, 4, 9, 9, 9] 1 x [1, 4, 9, 9, 9, 9, 9] 2 x [1, 2, 2, 4, 7, 8, 8] 1 x [2, 7, 7, 8]