Build (method = -2) #dp: 15521 Step-3' Graph: 220 vertices and 2717 arcs (0.07s) Step-4' Graph: 169 vertices and 2615 arcs (0.07s) #V4/#V3 = 0.77 #A4/#A3 = 0.96 Ready! (0.07s) Optimize a model with 255 rows, 2616 columns and 7515 nonzeros Presolve removed 28 rows and 33 columns Presolve time: 0.04s Presolved: 227 rows, 2583 columns, 7442 nonzeros Variable types: 0 continuous, 2583 integer (757 binary) Found heuristic solution: objective 181.0000000 Found heuristic solution: objective 146.0000000 Optimize a model with 227 rows, 2583 columns and 7442 nonzeros Presolved: 227 rows, 2583 columns, 7442 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.197e+03 Factor NZ : 1.313e+04 (roughly 1 MByte of memory) Factor Ops : 1.034e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.81440579e+04 -5.50670166e+04 2.15e+04 2.10e-01 1.57e+02 0s 1 4.59564303e+03 -1.51169444e+04 3.83e+03 7.77e-16 2.84e+01 0s 2 7.77255030e+02 -4.93309468e+03 3.38e+02 9.99e-16 3.16e+00 0s 3 2.91812093e+02 -1.73121183e+03 3.83e+01 1.78e-15 5.75e-01 0s 4 1.79163193e+02 -4.53988490e+02 6.46e+00 1.22e-15 1.42e-01 0s 5 1.50022851e+02 -2.81083849e+02 4.01e+00 5.55e-16 9.32e-02 0s 6 1.25184130e+02 -1.62135373e+02 2.71e+00 4.68e-16 6.12e-02 0s 7 9.99902308e+01 -5.71911683e+01 1.54e+00 4.44e-16 3.27e-02 0s 8 7.61940615e+01 1.47224241e+01 3.31e-01 6.66e-16 1.21e-02 0s 9 6.86034084e+01 3.32640938e+01 1.29e-01 4.44e-16 6.87e-03 0s 10 6.47684762e+01 5.00640774e+01 2.51e-02 5.55e-16 2.83e-03 0s 11 6.36963116e+01 5.75626778e+01 8.26e-03 4.44e-16 1.18e-03 0s 12 6.32372750e+01 6.05473417e+01 3.12e-03 4.44e-16 5.17e-04 0s 13 6.30650899e+01 6.21839372e+01 1.54e-03 3.88e-16 1.69e-04 0s 14 6.29596573e+01 6.28568067e+01 4.92e-04 6.66e-16 1.98e-05 0s 15 6.29136196e+01 6.29112494e+01 2.84e-14 4.44e-16 4.55e-07 0s 16 6.29133336e+01 6.29133312e+01 1.60e-13 7.77e-16 4.55e-10 0s 17 6.29133333e+01 6.29133333e+01 1.07e-13 6.66e-16 4.64e-16 0s Barrier solved model in 17 iterations and 0.05 seconds Optimal objective 6.29133333e+01 Root relaxation: objective 6.291333e+01, 1980 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 62.91333 0 82 146.00000 62.91333 56.9% - 0s H 0 0 67.0000000 62.91333 6.10% - 0s H 0 0 64.0000000 62.91333 1.70% - 0s 0 0 62.91333 0 120 64.00000 62.91333 1.70% - 0s 0 0 62.91333 0 141 64.00000 62.91333 1.70% - 0s H 0 0 63.0000000 62.91333 0.14% - 1s Cutting planes: Zero half: 1 Explored 0 nodes (3941 simplex iterations) in 1.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.300000000000e+01, best bound 6.300000000000e+01, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 1.05 seconds Total run time: 1.14 seconds Objective: 63 Solution: 2 x [43, 86] 1 x [10, 12, 26, 86] 1 x [12, 12, 25, 86] 3 x [21, 27, 85] 1 x [8, 38, 84] 1 x [13, 35, 83] 1 x [5, 22, 24, 83] 2 x [47, 82] 1 x [20, 31, 82] 3 x [48, 81] 2 x [49, 80] 1 x [25, 29, 79] 1 x [3, 48, 78] 1 x [14, 38, 78] 1 x [9, 19, 27, 78] 1 x [2, 45, 77] 1 x [16, 20, 20, 77] 1 x [53, 76] 1 x [3, 4, 47, 75] 1 x [56, 74] 1 x [53, 74] 1 x [7, 50, 73] 1 x [3, 15, 39, 73] 1 x [9, 9, 39, 73] 1 x [24, 34, 73] 1 x [17, 21, 23, 73] 1 x [57, 72] 1 x [58, 71] 1 x [19, 19, 22, 71] 1 x [1, 4, 55, 70] 1 x [1, 4, 54, 70] 1 x [13, 20, 32, 69] 1 x [60, 68] 1 x [25, 38, 68] 1 x [8, 56, 67] 2 x [33, 33, 66] 1 x [19, 46, 65] 1 x [12, 55, 64] 1 x [6, 15, 46, 64] 1 x [8, 28, 33, 64] 1 x [7, 60, 63] 1 x [28, 41, 62] 1 x [16, 20, 35, 62] 1 x [10, 19, 42, 61] 1 x [16, 58, 59] 1 x [6, 24, 45, 59] 1 x [31, 43, 59] 1 x [15, 26, 41, 52] 1 x [24, 30, 32, 51] 1 x [11, 34, 38, 49] 1 x [16, 30, 40, 46] 1 x [18, 34, 36, 44] 1 x [24, 31, 36, 44] 1 x [30, 32, 34, 38] 1 x [30, 32, 35, 37]