Build (method = -2) #dp: 3778 Step-3' Graph: 87 vertices and 1565 arcs (0.02s) Step-4' Graph: 87 vertices and 1565 arcs (0.02s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 158 rows, 1566 columns and 4532 nonzeros Presolve removed 27 rows and 35 columns Presolve time: 0.03s Presolved: 131 rows, 1531 columns, 4437 nonzeros Variable types: 0 continuous, 1531 integer (0 binary) Found heuristic solution: objective 455.0000000 Optimize a model with 131 rows, 1531 columns and 4437 nonzeros Presolved: 131 rows, 1531 columns, 4437 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.374e+03 Factor NZ : 4.530e+03 Factor Ops : 2.156e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.49288501e+03 -2.64632720e+04 8.20e+04 2.22e-16 7.02e+01 0s 1 2.00312818e+03 -8.64583965e+03 1.45e+04 6.66e-16 1.33e+01 0s 2 5.92577785e+02 -3.19199988e+03 1.19e+03 3.69e-14 1.87e+00 0s 3 4.06697421e+02 -1.23803304e+03 6.58e+01 1.35e-14 5.54e-01 0s 4 3.15064148e+02 -2.06927176e+02 1.07e+01 4.66e-15 1.71e-01 0s 5 2.60456138e+02 -3.75677321e+01 4.31e+00 3.11e-15 9.67e-02 0s 6 2.38170187e+02 9.65216985e+01 2.15e+00 2.86e-15 4.59e-02 0s 7 2.26222693e+02 1.62707963e+02 7.30e-01 2.79e-15 2.05e-02 0s 8 2.18614470e+02 1.97001535e+02 1.22e-01 2.43e-15 6.96e-03 0s 9 2.16695970e+02 2.01744654e+02 5.64e-02 2.91e-15 4.81e-03 0s 10 2.15126821e+02 2.11189142e+02 1.85e-02 2.68e-15 1.27e-03 0s 11 2.14264480e+02 2.12830133e+02 9.34e-04 2.36e-15 4.62e-04 0s 12 2.14176107e+02 2.13902780e+02 1.94e-04 2.03e-15 8.80e-05 0s 13 2.14148637e+02 2.14108113e+02 1.03e-05 2.02e-15 1.30e-05 0s 14 2.14142861e+02 2.14142757e+02 3.36e-09 1.90e-15 3.34e-08 0s 15 2.14142857e+02 2.14142857e+02 8.53e-14 2.63e-15 3.35e-14 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 2.14142857e+02 Root relaxation: objective 2.141429e+02, 257 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 214.14286 0 51 455.00000 214.14286 52.9% - 0s H 0 0 218.0000000 214.14286 1.77% - 0s H 0 0 216.0000000 214.14286 0.86% - 0s H 0 0 215.0000000 214.14286 0.40% - 0s Explored 0 nodes (377 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.150000000000e+02, best bound 2.150000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 215 Solution: 4 x [19, 71] 5 x [21, 70] 9 x [22, 69] 2 x [19, 69] 7 x [24, 68] 3 x [18, 68] 2 x [18, 67] 5 x [25, 66] 8 x [26, 65] 6 x [27, 64] 1 x [25, 64] 6 x [29, 63] 4 x [30, 62] 1 x [29, 62] 5 x [20, 62] 6 x [31, 61] 4 x [32, 60] 5 x [31, 60] 7 x [33, 59] 6 x [34, 58] 3 x [35, 57] 2 x [1, 5, 57] 5 x [36, 56] 4 x [2, 5, 56] 4 x [3, 5, 55] 1 x [1, 5, 55] 3 x [4, 4, 55] 3 x [38, 54] 3 x [39, 53] 2 x [2, 8, 53] 5 x [40, 52] 2 x [2, 9, 52] 5 x [41, 51] 2 x [6, 6, 51] 6 x [42, 50] 4 x [43, 49] 2 x [7, 7, 49] 8 x [44, 48] 5 x [45, 47] 1 x [46] 3 x [46, 46] 4 x [6, 12, 45] 1 x [7, 11, 45] 1 x [8, 10, 45] 1 x [8, 11, 44] 1 x [8, 12, 43] 1 x [6, 43] 1 x [10, 11, 42] 2 x [7, 15, 41] 5 x [11, 14, 38] 3 x [12, 13, 38] 5 x [13, 13, 37] 2 x [14, 14, 35] 1 x [14, 15, 34] 1 x [15, 15, 33] 1 x [17, 18, 28] 4 x [16, 16, 28] 2 x [17, 20, 26] 3 x [18, 22, 23] 2 x [17, 17, 23] 1 x [14, 17, 17] 3 x [1, 9, 10, 14] 1 x [3, 8, 11, 12]