Build (method = -2) #dp: 1293 Step-3' Graph: 71 vertices and 456 arcs (0.01s) Step-4' Graph: 40 vertices and 394 arcs (0.01s) #V4/#V3 = 0.56 #A4/#A3 = 0.86 Ready! (0.01s) Optimize a model with 78 rows, 395 columns and 1109 nonzeros Presolve removed 17 rows and 26 columns Presolve time: 0.01s Presolved: 61 rows, 369 columns, 1031 nonzeros Variable types: 0 continuous, 369 integer (218 binary) Found heuristic solution: objective 29.0000000 Optimize a model with 61 rows, 369 columns and 1031 nonzeros Presolved: 61 rows, 369 columns, 1031 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.960e+02 Factor NZ : 1.267e+03 Factor Ops : 3.260e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.72259632e+02 -2.02821631e+03 1.58e+03 2.49e-01 1.92e+01 0s 1 1.65164732e+02 -5.79803918e+02 2.89e+02 6.66e-16 3.55e+00 0s 2 5.43860054e+01 -1.63188586e+02 2.50e+01 4.44e-16 4.72e-01 0s 3 3.23682207e+01 -1.49437659e+01 7.62e-01 3.75e-16 6.65e-02 0s 4 2.50523527e+01 5.45181295e+00 2.04e-01 2.36e-16 2.67e-02 0s 5 2.30228665e+01 1.23843130e+01 6.11e-02 2.84e-16 1.43e-02 0s 6 2.18381644e+01 1.63160875e+01 2.46e-02 2.22e-16 7.42e-03 0s 7 2.10782490e+01 1.94615686e+01 8.10e-03 2.22e-16 2.17e-03 0s 8 2.05534952e+01 2.00431782e+01 7.96e-04 2.22e-16 6.84e-04 0s 9 2.04330046e+01 2.02558946e+01 1.77e-04 2.22e-16 2.37e-04 0s 10 2.03826047e+01 2.03474995e+01 6.76e-06 3.33e-16 4.71e-05 0s 11 2.03769631e+01 2.03746880e+01 2.36e-07 9.49e-17 3.05e-06 0s 12 2.03764727e+01 2.03764684e+01 2.07e-14 3.33e-16 5.79e-09 0s 13 2.03764706e+01 2.03764706e+01 1.01e-14 2.22e-16 5.86e-15 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 2.03764706e+01 Root relaxation: objective 2.037647e+01, 40 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.37647 0 25 29.00000 20.37647 29.7% - 0s H 0 0 21.0000000 20.37647 2.97% - 0s Explored 0 nodes (75 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 21 Solution: 2 x [15, 38] 1 x [16, 37] 1 x [2, 5, 37] 1 x [17, 36] 1 x [2, 6, 35] 1 x [19, 34] 1 x [1, 8, 34] 1 x [21, 33] 1 x [21, 32] 1 x [22, 31] 1 x [4, 10, 30] 1 x [24, 29] 1 x [3, 14, 28] 1 x [25, 27] 1 x [25, 26] 1 x [9, 11, 23] 1 x [7, 17, 21] 1 x [12, 13, 20] 1 x [18] 1 x [13, 14, 18]