Build (method = -2) #dp: 3167 Step-3' Graph: 88 vertices and 1103 arcs (0.01s) Step-4' Graph: 68 vertices and 1063 arcs (0.01s) #V4/#V3 = 0.77 #A4/#A3 = 0.96 Ready! (0.01s) Optimize a model with 133 rows, 1064 columns and 3060 nonzeros Presolve removed 27 rows and 39 columns Presolve time: 0.02s Presolved: 106 rows, 1025 columns, 2936 nonzeros Variable types: 0 continuous, 1025 integer (171 binary) Found heuristic solution: objective 177.0000000 Found heuristic solution: objective 155.0000000 Optimize a model with 106 rows, 1025 columns and 2936 nonzeros Presolved: 106 rows, 1025 columns, 2936 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.559e+03 Factor NZ : 2.908e+03 Factor Ops : 1.071e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.63211263e+03 -1.42853065e+04 2.47e+04 1.69e-01 9.16e+01 0s 1 1.32874290e+03 -5.16044971e+03 3.81e+03 1.55e-15 1.50e+01 0s 2 2.81097143e+02 -1.92470984e+03 2.06e+02 6.22e-15 1.60e+00 0s 3 1.76501553e+02 -2.67271912e+02 1.39e+01 3.89e-15 2.33e-01 0s 4 1.35975748e+02 -9.52526901e+01 2.40e+00 1.38e-15 1.13e-01 0s 5 1.09966298e+02 -6.08948710e+00 1.03e+00 1.22e-15 5.64e-02 0s 6 1.00256935e+02 3.98146476e+01 5.29e-01 1.22e-15 2.92e-02 0s 7 9.22325334e+01 7.16366962e+01 1.79e-01 1.10e-15 9.92e-03 0s 8 8.83782383e+01 8.10179417e+01 1.56e-02 1.20e-15 3.53e-03 0s 9 8.72821243e+01 8.39453375e+01 4.32e-03 1.35e-15 1.60e-03 0s 10 8.70415987e+01 8.48880081e+01 1.84e-03 1.40e-15 1.03e-03 0s 11 8.72665970e+01 8.60540510e+01 1.59e-03 1.40e-15 5.82e-04 0s 12 8.69359551e+01 8.62050257e+01 7.58e-05 9.94e-16 3.51e-04 0s 13 8.68826488e+01 8.68653980e+01 9.80e-13 1.55e-15 8.27e-06 0s 14 8.68750078e+01 8.68749904e+01 2.76e-12 1.19e-15 8.34e-09 0s 15 8.68750000e+01 8.68750000e+01 1.76e-12 1.46e-15 8.36e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 8.68750000e+01 Root relaxation: objective 8.687500e+01, 439 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 86.87500 0 28 155.00000 86.87500 44.0% - 0s H 0 0 88.0000000 86.87500 1.28% - 0s H 0 0 87.0000000 86.87500 0.14% - 0s Explored 0 nodes (855 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.700000000000e+01, best bound 8.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.08 seconds Total run time: 0.10 seconds Objective: 87 Solution: 2 x [19, 65] 1 x [21, 64] 3 x [16, 64] 5 x [20, 63] 3 x [22, 62] 3 x [25, 61] 2 x [23, 61] 3 x [26, 60] 1 x [27, 59] 2 x [26, 59] 2 x [28, 58] 1 x [24, 58] 1 x [29, 57] 2 x [30, 56] 2 x [31, 55] 2 x [32, 54] 3 x [32, 53] 1 x [1, 6, 52] 2 x [35, 51] 2 x [36, 50] 2 x [37, 49] 2 x [35, 49] 2 x [38, 48] 3 x [39, 47] 1 x [38, 47] 2 x [3, 8, 47] 1 x [5, 6, 47] 3 x [40, 46] 2 x [4, 8, 46] 4 x [41, 45] 3 x [3, 10, 45] 1 x [2, 9, 44] 1 x [34, 43] 1 x [33, 43] 1 x [2, 8, 43] 1 x [2, 14, 42] 1 x [8, 16, 35] 1 x [7, 12, 35] 1 x [7, 14, 34] 3 x [11, 13, 34] 1 x [11, 17, 31] 1 x [10, 17, 31] 1 x [12, 15, 31] 1 x [14, 14, 31] 3 x [11, 18, 30] 1 x [5, 14, 29]