Build (method = -2) #dp: 820 Step-3' Graph: 51 vertices and 396 arcs (0.00s) Step-4' Graph: 39 vertices and 372 arcs (0.00s) #V4/#V3 = 0.76 #A4/#A3 = 0.94 Ready! (0.00s) Optimize a model with 81 rows, 373 columns and 1045 nonzeros Presolve removed 33 rows and 40 columns Presolve time: 0.01s Presolved: 48 rows, 333 columns, 919 nonzeros Variable types: 0 continuous, 333 integer (257 binary) Found heuristic solution: objective 38.0000000 Found heuristic solution: objective 36.0000000 Optimize a model with 48 rows, 333 columns and 919 nonzeros Presolved: 48 rows, 333 columns, 919 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.200e+02 Factor NZ : 9.700e+02 Factor Ops : 2.384e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.53434419e+02 -4.03526164e+02 4.78e+02 2.10e-01 3.45e+00 0s 1 8.37646605e+01 -1.26489679e+02 6.75e+01 1.33e-15 6.20e-01 0s 2 4.12413819e+01 -3.83892833e+00 8.36e+00 1.33e-15 9.51e-02 0s 3 3.23166594e+01 2.15626543e+01 9.38e-01 4.44e-16 1.76e-02 0s 4 2.94171670e+01 2.40266450e+01 1.90e-01 3.25e-16 8.33e-03 0s 5 2.86813110e+01 2.53149425e+01 1.22e-01 6.66e-16 5.17e-03 0s 6 2.77198059e+01 2.64793216e+01 5.66e-02 4.44e-16 1.90e-03 0s 7 2.71290766e+01 2.67342345e+01 1.27e-02 4.24e-16 6.00e-04 0s 8 2.70123816e+01 2.69465960e+01 1.83e-03 4.44e-16 1.00e-04 0s 9 2.70000435e+01 2.69998775e+01 5.82e-06 4.44e-16 2.54e-07 0s 10 2.70000000e+01 2.69999999e+01 1.42e-13 4.44e-16 2.54e-10 0s 11 2.70000000e+01 2.70000000e+01 1.01e-13 2.22e-16 3.62e-16 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 2.70000000e+01 Root relaxation: objective 2.700000e+01, 147 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 27.0000000 27.00000 0.0% - 0s Explored 0 nodes (157 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.700000000000e+01, best bound 2.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 27 Solution: 1 x [42] 2 x [41] 1 x [40] 1 x [1, 39] 1 x [2, 38] 2 x [3, 37] 1 x [6, 36] 1 x [8, 35] 1 x [7, 34] 1 x [9, 33] 1 x [5, 32] 1 x [10, 31] 1 x [4, 31] 1 x [12, 30] 1 x [14, 29] 1 x [11, 29] 1 x [15, 28] 1 x [17, 27] 1 x [13, 26] 1 x [19, 25] 1 x [17, 24] 1 x [16, 24] 1 x [20, 23] 1 x [21, 22] 1 x [18, 19]