Build (method = -2) #dp: 13653 Step-3' Graph: 159 vertices and 525 arcs (0.07s) Step-4' Graph: 78 vertices and 363 arcs (0.07s) #V4/#V3 = 0.49 #A4/#A3 = 0.69 Ready! (0.07s) Optimize a model with 97 rows, 364 columns and 945 nonzeros Presolve removed 19 rows and 33 columns Presolve time: 0.00s Presolved: 78 rows, 331 columns, 903 nonzeros Variable types: 0 continuous, 331 integer (34 binary) Found heuristic solution: objective 196.0000000 Found heuristic solution: objective 160.0000000 Optimize a model with 78 rows, 331 columns and 903 nonzeros Presolved: 78 rows, 331 columns, 903 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.810e+02 Factor NZ : 1.308e+03 Factor Ops : 2.481e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.21979674e+03 -6.44153911e+03 9.15e+03 1.52e-01 1.15e+02 0s 1 8.85722716e+02 -2.71900762e+03 1.79e+03 7.77e-16 2.28e+01 0s 2 1.78476251e+02 -1.06672418e+03 1.17e+02 7.77e-16 2.77e+00 0s 3 1.01076795e+02 -1.51174737e+02 8.19e+00 6.66e-16 4.04e-01 0s 4 4.93103526e+01 -2.34296725e+01 1.87e+00 3.75e-16 1.11e-01 0s 5 3.73486264e+01 1.23095950e+01 6.07e-01 3.19e-16 3.77e-02 0s 6 3.51605564e+01 2.70447708e+01 2.29e-01 2.88e-16 1.21e-02 0s 7 3.35927232e+01 3.26406224e+01 4.15e-03 5.55e-16 1.40e-03 0s 8 3.33351140e+01 3.33101720e+01 6.25e-14 6.66e-16 3.67e-05 0s 9 3.33333337e+01 3.33333330e+01 8.71e-14 2.80e-16 1.16e-09 0s 10 3.33333333e+01 3.33333333e+01 2.60e-14 3.61e-16 1.16e-12 0s Barrier solved model in 10 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 232 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 23 160.00000 33.33333 79.2% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (355 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.02 seconds Total run time: 0.09 seconds Objective: 34 Solution: 1 x [1, 5, 9, 17, 18] 8 x [1, 1, 5, 9, 17, 18] 2 x [3, 4, 4, 5, 6, 11] 6 x [4, 4, 5, 7, 9, 11] 1 x [8, 11, 13, 13, 13] 1 x [11, 11, 13, 15, 19] 1 x [11, 11, 13, 15, 15, 19] 1 x [9, 11, 12, 13, 14, 17] 3 x [2, 10, 11, 12, 13, 17] 1 x [19, 19, 19, 19, 19] 3 x [2, 12, 12, 12, 12, 12] 6 x [6, 11, 11, 16, 16, 16]