Build (method = -2) #dp: 2798 Step-3' Graph: 173 vertices and 970 arcs (0.01s) Step-4' Graph: 79 vertices and 782 arcs (0.01s) #V4/#V3 = 0.46 #A4/#A3 = 0.81 Ready! (0.01s) Optimize a model with 129 rows, 783 columns and 2195 nonzeros Presolve removed 39 rows and 39 columns Presolve time: 0.01s Presolved: 90 rows, 744 columns, 2093 nonzeros Variable types: 0 continuous, 744 integer (652 binary) Found heuristic solution: objective 23.0000000 Optimize a model with 90 rows, 744 columns and 2093 nonzeros Presolved: 90 rows, 744 columns, 2093 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.014e+03 Factor NZ : 2.417e+03 Factor Ops : 8.026e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.59830876e+03 -1.32558600e+03 2.59e+03 2.01e-01 7.68e+00 0s 1 4.08812852e+02 -4.41386892e+02 5.43e+02 4.44e-16 1.68e+00 0s 2 8.02242768e+01 -8.56193698e+01 5.50e+01 4.44e-16 2.10e-01 0s 3 3.04555005e+01 8.71484504e-01 3.51e+00 4.44e-16 2.49e-02 0s 4 2.42085895e+01 1.76675238e+01 1.99e-01 2.22e-16 4.48e-03 0s 5 2.26213946e+01 1.97757861e+01 7.04e-02 2.22e-16 1.92e-03 0s 6 2.20377754e+01 2.07331915e+01 3.01e-02 2.54e-16 8.77e-04 0s 7 2.16397976e+01 2.08223386e+01 1.12e-02 2.42e-16 5.49e-04 0s 8 2.14119165e+01 2.11207878e+01 2.05e-03 2.22e-16 1.96e-04 0s 9 2.13546073e+01 2.12554829e+01 8.80e-04 1.11e-16 6.66e-05 0s 10 2.13347325e+01 2.13316184e+01 3.06e-13 2.22e-16 2.09e-06 0s 11 2.13333348e+01 2.13333316e+01 1.36e-12 3.33e-16 2.10e-09 0s 12 2.13333333e+01 2.13333333e+01 3.89e-13 2.22e-16 2.10e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 2.13333333e+01 Root relaxation: objective 2.133333e+01, 372 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.33333 0 12 23.00000 21.33333 7.25% - 0s H 0 0 22.0000000 21.33333 3.03% - 0s Explored 0 nodes (571 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.05 seconds Objective: 22 Solution: 1 x [12, 50] 1 x [16, 49] 1 x [19, 47] 1 x [15, 48] 1 x [21, 44] 1 x [22, 43] 1 x [18, 45] 1 x [7, 9, 42] 1 x [3, 4, 46] 1 x [24, 41] 1 x [26, 40] 1 x [28, 39] 1 x [29, 38] 1 x [34, 35] 1 x [33, 36] 1 x [31, 37] 1 x [14, 30] 1 x [2, 17, 27] 1 x [1, 5, 6, 25] 1 x [8, 11, 32] 1 x [23] 1 x [10, 13, 20]