Build (method = -2) #dp: 83434 Step-3' Graph: 561 vertices and 5268 arcs (0.91s) Step-4' Graph: 293 vertices and 4732 arcs (0.91s) #V4/#V3 = 0.52 #A4/#A3 = 0.90 Ready! (0.91s) Optimize a model with 429 rows, 4733 columns and 13617 nonzeros Presolve removed 18 rows and 26 columns Presolve time: 0.09s Presolved: 411 rows, 4707 columns, 13585 nonzeros Variable types: 0 continuous, 4707 integer (2454 binary) Found heuristic solution: objective 113.0000000 Optimize a model with 411 rows, 4707 columns and 13585 nonzeros Presolved: 411 rows, 4707 columns, 13585 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.021e+04 Factor NZ : 2.069e+04 (roughly 2 MBytes of memory) Factor Ops : 1.701e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.26360638e+04 -1.88081611e+05 6.22e+04 1.80e-01 1.50e+02 0s 1 1.03768937e+04 -2.46430842e+04 1.28e+04 9.99e-16 2.86e+01 0s 2 1.59538116e+03 -5.95490467e+03 1.55e+03 1.11e-15 3.77e+00 0s 3 3.65837339e+02 -1.94911094e+03 1.02e+02 9.44e-16 4.13e-01 0s 4 1.71692780e+02 -4.13011549e+02 1.38e+01 6.11e-16 7.94e-02 0s 5 1.03021676e+02 -1.43591076e+02 4.68e+00 7.01e-16 3.08e-02 0s 6 6.92452264e+01 -6.89148981e+01 2.09e+00 8.19e-16 1.63e-02 0s 7 5.61285098e+01 -7.29314887e+00 1.06e+00 6.44e-16 7.32e-03 0s 8 5.24013093e+01 3.90637652e+01 3.63e-01 5.55e-16 1.49e-03 0s 9 5.06189325e+01 4.90024908e+01 1.28e-03 7.77e-16 1.71e-04 0s 10 5.00007405e+01 4.99556776e+01 5.69e-13 5.63e-16 4.76e-06 0s 11 5.00000000e+01 4.99999997e+01 8.15e-13 6.58e-16 3.93e-11 0s Barrier solved model in 11 iterations and 0.06 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 4067 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (4471 simplex iterations) in 0.37 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.94 seconds Gurobi run time: 0.37 seconds Total run time: 1.32 seconds Objective: 50 Solution: 1 x [55, 55, 71, 136] 1 x [36, 112, 113, 135] 1 x [6, 117, 133, 134] 1 x [11, 79, 128, 134] 1 x [61, 106, 110, 133] 1 x [22, 119, 124, 132] 1 x [9, 92, 113, 131] 1 x [30, 111, 116, 130] 1 x [18, 29, 95, 129] 1 x [17, 91, 112, 128] 1 x [12, 104, 113, 127] 1 x [4, 97, 100, 126] 1 x [31, 43, 118, 125] 1 x [8, 102, 115, 123] 1 x [15, 91, 121, 122] 1 x [39, 77, 84, 120] 1 x [48, 105, 117, 118] 1 x [22, 99, 108, 116] 1 x [25, 42, 62, 115] 1 x [58, 107, 109, 114] 1 x [1, 101, 104, 114] 1 x [5, 93, 106, 109] 1 x [24, 81, 81, 108] 1 x [7, 50, 90, 103] 1 x [8, 89, 89, 102] 1 x [5, 72, 93, 98] 2 x [16, 50, 85, 96] 1 x [24, 41, 76, 94] 2 x [33, 61, 83, 90] 1 x [8, 33, 82, 90] 1 x [5, 59, 87, 88] 1 x [54, 78, 80, 86] 1 x [2, 3, 51, 81] 1 x [38, 44, 69, 75] 1 x [9, 10, 73, 74] 1 x [64, 65, 65, 72] 1 x [12, 14, 51, 70] 1 x [13, 20, 49, 68] 1 x [37, 45, 57, 67] 1 x [13, 27, 49, 66] 2 x [34, 35, 40, 63] 2 x [55, 56, 59, 60] 1 x [19, 21, 32, 56] 1 x [18, 23, 28, 53] 2 x [26, 46, 47, 52]