Build (method = -2) #dp: 1000 Step-3' Graph: 51 vertices and 295 arcs (0.01s) Step-4' Graph: 35 vertices and 263 arcs (0.01s) #V4/#V3 = 0.69 #A4/#A3 = 0.89 Ready! (0.01s) Optimize a model with 55 rows, 264 columns and 730 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 52 rows, 260 columns, 722 nonzeros Variable types: 0 continuous, 260 integer (0 binary) Found heuristic solution: objective 104.0000000 Found heuristic solution: objective 102.0000000 Optimize a model with 52 rows, 260 columns and 722 nonzeros Presolved: 52 rows, 260 columns, 722 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.800e+02 Factor NZ : 9.300e+02 Factor Ops : 1.956e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.17398066e+03 -2.76143176e+03 1.79e+03 2.22e-16 3.69e+01 0s 1 3.05053599e+02 -1.12167396e+03 2.48e+02 5.55e-16 6.04e+00 0s 2 1.01230918e+02 -3.73554116e+02 1.49e+01 5.11e-15 1.02e+00 0s 3 5.55169890e+01 -5.42106906e+01 4.19e-03 7.77e-16 2.03e-01 0s 4 3.05820658e+01 -1.46711032e+01 1.04e-03 2.22e-16 8.38e-02 0s 5 2.64127775e+01 8.99412574e+00 3.90e-04 2.22e-16 3.23e-02 0s 6 2.31350262e+01 1.82475192e+01 1.08e-04 2.22e-16 9.05e-03 0s 7 2.18478888e+01 2.10764767e+01 1.73e-05 2.33e-16 1.43e-03 0s 8 2.16015128e+01 2.15938735e+01 9.30e-15 3.33e-16 1.41e-05 0s 9 2.16000000e+01 2.16000000e+01 1.32e-14 3.33e-16 2.89e-11 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 2.16000000e+01 Root relaxation: objective 2.160000e+01, 132 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.60000 0 26 102.00000 21.60000 78.8% - 0s H 0 0 23.0000000 21.60000 6.09% - 0s 0 0 21.60000 0 37 23.00000 21.60000 6.09% - 0s 0 0 21.60000 0 41 23.00000 21.60000 6.09% - 0s H 0 0 22.0000000 21.60000 1.82% - 0s Cutting planes: Zero half: 2 Explored 0 nodes (192 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 22 Solution: 2 x [6, 9, 10, 10, 16] 1 x [4, 6, 7, 15, 16] 2 x [2, 6, 15, 15, 20] 2 x [1, 4, 4, 4, 6] 2 x [3, 8, 9, 14, 18] 2 x [3, 3, 7, 7, 20] 1 x [8, 14, 19, 20] 1 x [8, 14, 18, 20, 20] 2 x [1, 11, 14, 18, 19] 1 x [8, 12, 13, 14, 17] 2 x [1, 1, 13, 14, 17] 1 x [1, 5, 11, 11, 18] 1 x [12, 14, 18, 18] 1 x [5, 9, 9, 9, 11] 1 x [5, 9, 9, 11, 11]