Build (method = -2) #dp: 2000 Step-3' Graph: 78 vertices and 918 arcs (0.01s) Step-4' Graph: 66 vertices and 894 arcs (0.01s) #V4/#V3 = 0.85 #A4/#A3 = 0.97 Ready! (0.01s) Optimize a model with 121 rows, 895 columns and 2558 nonzeros Presolve removed 25 rows and 33 columns Presolve time: 0.02s Presolved: 96 rows, 862 columns, 2441 nonzeros Variable types: 0 continuous, 862 integer (318 binary) Found heuristic solution: objective 75.0000000 Optimize a model with 96 rows, 862 columns and 2441 nonzeros Presolved: 96 rows, 862 columns, 2441 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.278e+03 Factor NZ : 2.725e+03 Factor Ops : 1.029e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.57470551e+03 -4.42071681e+03 8.73e+03 1.62e-01 2.63e+01 0s 1 3.91859901e+02 -1.35603961e+03 9.96e+02 6.66e-16 3.43e+00 0s 2 1.27235113e+02 -4.29290581e+02 9.17e+01 5.55e-16 4.99e-01 0s 3 7.17887401e+01 -5.60847222e+01 8.72e+00 5.55e-16 8.44e-02 0s 4 5.61265915e+01 1.10369344e+01 2.75e+00 4.44e-16 2.81e-02 0s 5 5.29083016e+01 2.25980229e+01 1.77e+00 2.74e-16 1.85e-02 0s 6 4.79584633e+01 3.48801029e+01 6.72e-01 2.32e-16 7.79e-03 0s 7 4.58531377e+01 3.93377074e+01 1.02e-01 2.22e-16 3.77e-03 0s 8 4.53153222e+01 4.29017965e+01 3.53e-02 2.08e-16 1.39e-03 0s 9 4.50522233e+01 4.38492403e+01 1.75e-02 3.33e-16 6.94e-04 0s 10 4.48255141e+01 4.42351613e+01 5.18e-03 2.22e-16 3.40e-04 0s 11 4.47425789e+01 4.47087651e+01 2.91e-06 2.59e-16 1.94e-05 0s 12 4.47333521e+01 4.47332261e+01 6.08e-13 3.33e-16 7.23e-08 0s 13 4.47333333e+01 4.47333333e+01 4.26e-14 3.33e-16 7.35e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 4.47333333e+01 Root relaxation: objective 4.473333e+01, 295 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 44.73333 0 21 75.00000 44.73333 40.4% - 0s H 0 0 45.0000000 44.73333 0.59% - 0s Explored 0 nodes (492 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.500000000000e+01, best bound 4.500000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 45 Solution: 1 x [14, 55] 2 x [18, 54] 2 x [15, 53] 1 x [14, 52] 3 x [19, 51] 4 x [21, 50] 2 x [15, 49] 1 x [21, 48] 1 x [20, 47] 2 x [25, 46] 1 x [24, 46] 1 x [23, 46] 2 x [26, 45] 1 x [26, 44] 1 x [27, 43] 1 x [17, 42] 1 x [2, 4, 42] 1 x [1, 5, 41] 2 x [28, 40] 1 x [29, 39] 2 x [30, 38] 1 x [3, 8, 37] 2 x [31, 36] 1 x [32, 35] 1 x [33, 34] 1 x [6, 8, 34] 1 x [7, 10, 31] 2 x [13, 16, 22] 1 x [11, 12, 22] 1 x [10, 12, 22] 1 x [1, 9, 11]