Build (method = -2) #dp: 11383 Step-3' Graph: 300 vertices and 944 arcs (0.08s) Step-4' Graph: 144 vertices and 634 arcs (0.08s) #V4/#V3 = 0.48 #A4/#A3 = 0.67 Ready! (0.08s) Optimize a model with 172 rows, 635 columns and 1619 nonzeros Presolve removed 46 rows and 88 columns Presolve time: 0.01s Presolved: 126 rows, 547 columns, 1461 nonzeros Variable types: 0 continuous, 547 integer (144 binary) Found heuristic solution: objective 33.0000000 Found heuristic solution: objective 31.0000000 Found heuristic solution: objective 30.0000000 Found heuristic solution: objective 23.0000000 Optimize a model with 126 rows, 547 columns and 1461 nonzeros Presolved: 126 rows, 547 columns, 1461 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.930e+02 Factor NZ : 2.006e+03 Factor Ops : 3.634e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.12706067e+02 -2.33356922e+03 2.37e+03 1.61e-01 2.00e+01 0s 1 2.05704403e+02 -1.13063152e+03 4.54e+02 6.66e-16 4.21e+00 0s 2 5.32407991e+01 -4.55489931e+02 4.25e+01 1.22e-15 6.70e-01 0s 3 3.03496965e+01 -7.37718164e+01 2.16e+00 5.55e-16 9.91e-02 0s 4 1.23013016e+01 -1.48581016e+01 2.98e-02 3.61e-16 2.45e-02 0s 5 8.22083811e+00 -6.46521541e+00 1.45e-02 3.72e-16 1.33e-02 0s 6 7.54750369e+00 -9.60514177e-01 8.19e-03 3.02e-16 7.68e-03 0s 7 6.95033322e+00 3.82728733e+00 5.03e-03 3.53e-16 2.82e-03 0s 8 6.26997511e+00 6.14998163e+00 1.64e-05 3.55e-16 1.08e-04 0s 9 6.25000707e+00 6.24990377e+00 5.82e-09 3.33e-16 9.32e-08 0s 10 6.25000001e+00 6.24999990e+00 8.04e-14 2.79e-16 9.32e-11 0s 11 6.25000000e+00 6.25000000e+00 1.26e-13 3.33e-16 1.31e-16 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 6.25000000e+00 Root relaxation: objective 6.250000e+00, 336 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 6.25000 0 11 23.00000 6.25000 72.8% - 0s H 0 0 7.0000000 6.25000 10.7% - 0s Explored 0 nodes (497 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.03 seconds Total run time: 0.12 seconds Objective: 7 Solution: 1 x [1, 2, 8, 9, 24, 27] 1 x [2, 7, 7, 7, 7, 11, 12, 28] 1 x [3, 12, 14, 14, 19, 20, 28] 1 x [12, 16, 19, 22, 22, 25, 26] 1 x [4, 9, 12, 13, 16, 19, 20, 25] 1 x [6, 8, 9, 15, 17, 18, 23] 1 x [5, 5, 8, 10, 10, 10, 21]