Build (method = -2) #dp: 90943 Step-3' Graph: 685 vertices and 2429 arcs (0.91s) Step-4' Graph: 228 vertices and 1516 arcs (0.92s) #V4/#V3 = 0.33 #A4/#A3 = 0.62 Ready! (0.92s) Optimize a model with 339 rows, 1517 columns and 4098 nonzeros Presolve removed 40 rows and 69 columns Presolve time: 0.03s Presolved: 299 rows, 1448 columns, 3975 nonzeros Variable types: 0 continuous, 1448 integer (507 binary) Found heuristic solution: objective 145.0000000 Found heuristic solution: objective 140.0000000 Optimize a model with 299 rows, 1448 columns and 3975 nonzeros Presolved: 299 rows, 1448 columns, 3975 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.252e+03 Factor NZ : 4.645e+03 Factor Ops : 1.127e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.18369460e+04 -1.47263774e+04 2.85e+04 2.26e-01 1.06e+02 0s 1 5.11661021e+03 -5.28681886e+03 5.98e+03 5.55e-16 2.26e+01 0s 2 5.67068498e+02 -2.05681726e+03 4.68e+02 9.99e-16 2.30e+00 0s 3 1.72661775e+02 -6.42266578e+02 4.27e+01 7.77e-16 3.61e-01 0s 4 9.37165521e+01 -1.49625006e+02 4.57e+00 3.05e-16 8.72e-02 0s 5 5.77155213e+01 -6.12009150e+01 1.64e+00 3.71e-16 4.14e-02 0s 6 4.44221885e+01 -1.07020478e+01 6.59e-01 2.60e-16 1.89e-02 0s 7 4.27399535e+01 2.49193303e+01 3.83e-01 2.22e-16 6.09e-03 0s 8 4.01800018e+01 3.94500194e+01 1.80e-04 2.79e-16 2.47e-04 0s 9 4.00003189e+01 3.99971027e+01 2.85e-07 3.28e-16 1.09e-06 0s 10 4.00000003e+01 3.99999971e+01 9.60e-14 2.99e-16 1.09e-09 0s 11 4.00000000e+01 4.00000000e+01 2.31e-13 3.33e-16 1.12e-15 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 990 iterations, 0.02 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 (1216 simplex iterations) in 0.09 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.93 seconds Gurobi run time: 0.09 seconds Total run time: 1.02 seconds Objective: 40 Solution: 1 x [87, 97, 98, 109, 111] 1 x [40, 70, 80, 108, 110] 3 x [18, 48, 54, 81, 108] 1 x [9, 98, 104, 105, 107] 2 x [13, 26, 37, 64, 106] 1 x [68, 89, 97, 99, 103] 1 x [83, 86, 98, 99, 102] 1 x [7, 68, 98, 99, 101] 1 x [1, 71, 98, 98, 100] 2 x [11, 71, 89, 91, 96] 1 x [25, 52, 76, 77, 96] 1 x [53, 53, 86, 95, 95] 1 x [29, 73, 90, 92, 94] 1 x [22, 22, 72, 93, 93] 1 x [19, 69, 75, 79, 88] 1 x [17, 58, 63, 67, 85] 1 x [3, 28, 29, 77, 84] 1 x [8, 18, 36, 76, 84] 3 x [4, 15, 45, 74, 82] 1 x [10, 42, 62, 62, 78] 1 x [14, 20, 43, 65, 76] 2 x [16, 21, 32, 44, 74] 1 x [24, 31, 50, 65, 73] 1 x [4, 41, 55, 61, 66] 2 x [2, 4, 23, 27, 60] 1 x [39, 49, 51, 57, 59] 1 x [38, 46, 47, 56, 59] 2 x [5, 12, 34, 35, 56] 3 x [6, 10, 30, 33, 52]