Build (method = -2) #dp: 77151 Step-3' Graph: 542 vertices and 5179 arcs (0.73s) Step-4' Graph: 288 vertices and 4671 arcs (0.74s) #V4/#V3 = 0.53 #A4/#A3 = 0.90 Ready! (0.74s) Optimize a model with 417 rows, 4672 columns and 13445 nonzeros Presolve removed 8 rows and 12 columns Presolve time: 0.06s Presolved: 409 rows, 4660 columns, 13433 nonzeros Variable types: 0 continuous, 4660 integer (2691 binary) Found heuristic solution: objective 115.0000000 Optimize a model with 409 rows, 4660 columns and 13433 nonzeros Presolved: 409 rows, 4660 columns, 13433 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.964e+03 Factor NZ : 2.044e+04 (roughly 2 MBytes of memory) Factor Ops : 1.703e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.02612179e+04 -2.21804069e+05 7.15e+04 1.87e-01 1.76e+02 0s 1 8.89987613e+03 -2.76315557e+04 1.30e+04 6.66e-16 2.97e+01 0s 2 1.49825040e+03 -6.74756371e+03 1.59e+03 9.99e-16 3.97e+00 0s 3 3.98639245e+02 -2.05260784e+03 1.08e+02 1.11e-15 4.40e-01 0s 4 1.92933712e+02 -4.59357823e+02 2.32e+01 5.55e-16 1.01e-01 0s 5 1.19541527e+02 -1.42618373e+02 7.20e+00 3.19e-16 3.55e-02 0s 6 8.60621447e+01 -5.63298078e+01 4.34e+00 2.78e-16 1.90e-02 0s 7 6.44991826e+01 -1.34829894e+01 2.40e+00 2.78e-16 1.01e-02 0s 8 5.50812570e+01 2.72698249e+01 1.01e+00 3.59e-16 3.41e-03 0s 9 5.10831803e+01 4.59559418e+01 3.43e-03 4.44e-16 5.47e-04 0s 10 5.02198811e+01 4.94271234e+01 8.25e-04 2.77e-16 8.46e-05 0s 11 5.00002394e+01 4.99989257e+01 1.11e-06 3.33e-16 1.40e-07 0s 12 5.00000000e+01 5.00000000e+01 2.64e-12 3.33e-16 1.41e-13 0s Barrier solved model in 12 iterations and 0.05 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 4030 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 50.00000 0 44 115.00000 50.00000 56.5% - 0s H 0 0 51.0000000 50.00000 1.96% - 0s H 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (4547 simplex iterations) in 0.34 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.76 seconds Gurobi run time: 0.34 seconds Total run time: 1.10 seconds Objective: 50 Solution: 2 x [30, 55, 63, 129] 1 x [46, 85, 120, 128] 1 x [4, 76, 106, 128] 1 x [1, 66, 74, 127] 1 x [56, 95, 101, 126] 1 x [14, 17, 109, 125] 1 x [2, 75, 107, 125] 1 x [17, 97, 119, 124] 1 x [57, 99, 103, 124] 1 x [31, 101, 104, 123] 1 x [10, 29, 72, 122] 1 x [6, 83, 114, 121] 1 x [8, 77, 111, 118] 1 x [16, 101, 101, 118] 1 x [20, 97, 111, 117] 1 x [2, 91, 95, 116] 1 x [5, 90, 113, 115] 1 x [5, 81, 94, 113] 1 x [35, 52, 78, 112] 1 x [11, 105, 108, 110] 1 x [27, 47, 79, 110] 1 x [64, 71, 89, 105] 2 x [3, 45, 82, 103] 1 x [21, 74, 74, 102] 1 x [1, 96, 97, 100] 1 x [4, 45, 84, 98] 1 x [7, 35, 80, 93] 1 x [28, 49, 70, 92] 1 x [28, 50, 69, 92] 2 x [15, 33, 67, 92] 1 x [22, 25, 88, 90] 1 x [19, 24, 87, 90] 1 x [39, 61, 68, 90] 2 x [32, 44, 59, 90] 1 x [2, 71, 84, 86] 1 x [2, 80, 83, 83] 1 x [48, 54, 54, 73] 2 x [12, 36, 43, 67] 1 x [18, 23, 40, 66] 1 x [41, 42, 42, 65] 2 x [13, 14, 58, 62] 1 x [37, 38, 53, 60] 1 x [9, 29, 34, 51] 1 x [20, 26, 27, 27]