Build (method = -2) #dp: 3304 Step-3' Graph: 149 vertices and 439 arcs (0.03s) Step-4' Graph: 18 vertices and 177 arcs (0.03s) #V4/#V3 = 0.12 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 63 rows, 178 columns and 503 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 61 rows, 176 columns, 499 nonzeros Variable types: 0 continuous, 176 integer (27 binary) Found heuristic solution: objective 108.0000000 Found heuristic solution: objective 104.0000000 Optimize a model with 61 rows, 176 columns and 499 nonzeros Presolved: 61 rows, 176 columns, 499 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.900e+02 Factor NZ : 6.570e+02 Factor Ops : 1.202e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.23643639e+02 -4.43645549e+02 8.74e+01 3.72e-02 5.40e+00 0s 1 1.07668310e+02 -1.59477767e+02 1.92e-13 2.22e-16 7.13e-01 0s 2 5.21589248e+01 7.57609959e+00 4.00e-14 2.22e-16 1.16e-01 0s 3 4.01371431e+01 3.79567667e+01 6.85e-14 1.80e-16 5.62e-03 0s 4 4.00001666e+01 3.99979573e+01 4.22e-14 2.22e-16 5.69e-06 0s 5 4.00000000e+01 4.00000000e+01 3.66e-14 7.90e-17 5.70e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 138 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 (138 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.04 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 40 Solution: 4 x [42, 44, 45] 3 x [10, 40, 45] 1 x [19, 19, 44] 3 x [9, 14, 43] 2 x [3, 6, 41] 1 x [21, 21, 39] 2 x [12, 13, 38] 1 x [22, 22, 37] 3 x [4, 8, 36] 1 x [23, 23, 35] 1 x [29, 33, 34] 4 x [17, 31, 33] 3 x [7, 12, 32] 4 x [11, 20, 30] 1 x [6, 24, 28] 2 x [2, 26, 27] 1 x [1, 15, 25] 2 x [5, 16, 18] 1 x [1, 3, 7]