Build (method = -2) #dp: 3361 Step-3' Graph: 150 vertices and 442 arcs (0.03s) Step-4' Graph: 16 vertices and 174 arcs (0.03s) #V4/#V3 = 0.11 #A4/#A3 = 0.39 Ready! (0.03s) Optimize a model with 62 rows, 175 columns and 498 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 60 rows, 173 columns, 494 nonzeros Variable types: 0 continuous, 173 integer (42 binary) Found heuristic solution: objective 67.0000000 Optimize a model with 60 rows, 173 columns and 494 nonzeros Presolved: 60 rows, 173 columns, 494 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.850e+02 Factor NZ : 6.510e+02 Factor Ops : 1.199e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.81746191e+02 -4.01707480e+02 6.76e+01 2.94e-02 4.77e+00 0s 1 8.75185181e+01 -1.39017785e+02 2.70e-13 2.22e-16 6.19e-01 0s 2 4.71456830e+01 2.11544407e+01 4.44e-14 2.22e-16 6.94e-02 0s 3 4.00793334e+01 3.96086908e+01 9.85e-14 2.91e-16 1.25e-03 0s 4 4.00000802e+01 3.99996096e+01 1.05e-13 1.11e-16 1.25e-06 0s 5 4.00000000e+01 4.00000000e+01 1.52e-13 2.22e-16 1.25e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 135 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (135 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 40 Solution: 1 x [34, 44, 46] 4 x [16, 33, 46] 3 x [27, 29, 45] 1 x [20, 30, 43] 1 x [5, 11, 43] 1 x [32, 38, 42] 1 x [9, 17, 42] 1 x [36, 40, 41] 1 x [13, 19, 41] 5 x [7, 35, 40] 3 x [26, 26, 39] 2 x [8, 33, 37] 1 x [18, 28, 35] 1 x [15, 21, 34] 4 x [4, 24, 31] 2 x [3, 12, 25] 3 x [14, 18, 23] 2 x [1, 2, 22] 3 x [6, 10, 15]