Build (method = -2) #dp: 208084 Step-3' Graph: 1370 vertices and 55504 arcs (2.00s) Step-4' Graph: 1236 vertices and 55239 arcs (2.03s) #V4/#V3 = 0.90 #A4/#A3 = 1.00 Ready! (2.03s) Optimize a model with 1385 rows, 55240 columns and 163249 nonzeros Presolve removed 35 rows and 60 columns Presolve time: 1.46s Presolved: 1350 rows, 55180 columns, 163239 nonzeros Variable types: 0 continuous, 55180 integer (37765 binary) Found heuristic solution: objective 171.0000000 Optimize a model with 1350 rows, 55180 columns and 163239 nonzeros Presolved: 1350 rows, 55180 columns, 163239 nonzeros Root barrier log... Ordering time: 0.10s Barrier statistics: AA' NZ : 1.186e+05 Factor NZ : 3.072e+05 (roughly 25 MBytes of memory) Factor Ops : 9.309e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.02314496e+04 -9.68380183e+05 5.46e+05 1.38e-01 7.37e+01 0s 1 1.33960219e+04 -2.46675816e+05 1.55e+05 1.11e-15 2.05e+01 0s 2 4.57372091e+03 -6.86094198e+04 2.49e+04 2.44e-15 3.49e+00 0s 3 2.27994639e+03 -4.13536390e+04 3.40e+03 2.44e-15 7.67e-01 1s 4 1.29030605e+03 -2.23847998e+04 8.58e+02 2.66e-15 3.03e-01 1s 5 7.60581463e+02 -6.17729619e+03 2.74e+02 8.88e-16 9.00e-02 1s 6 3.69741693e+02 -2.46946043e+03 9.27e+01 8.88e-16 3.47e-02 1s 7 1.90150398e+02 -6.86695471e+02 2.81e+01 1.11e-15 1.02e-02 1s 8 1.60006158e+02 -4.38382192e+02 2.01e+01 8.26e-16 6.73e-03 1s 9 1.52910524e+02 -3.47078197e+02 1.82e+01 9.82e-16 5.60e-03 1s 10 1.29845370e+02 -3.25855190e+02 1.31e+01 1.11e-15 4.88e-03 1s 11 1.09293418e+02 -2.53678502e+02 9.40e+00 1.38e-15 3.78e-03 1s 12 9.11958160e+01 -1.84714871e+02 6.58e+00 1.33e-15 2.81e-03 1s 13 7.89129421e+01 -1.47663211e+02 5.28e+00 1.17e-15 2.28e-03 1s 14 6.82854911e+01 -1.20890781e+02 4.25e+00 1.33e-15 1.89e-03 1s 15 6.05989467e+01 -9.14460670e+01 3.28e+00 1.04e-15 1.49e-03 1s 16 5.29254573e+01 -6.87537410e+01 2.43e+00 1.14e-15 1.18e-03 1s 17 4.60225021e+01 5.26801908e+00 1.25e+00 7.19e-16 3.85e-04 2s 18 4.46744002e+01 1.50495948e+01 1.04e+00 7.86e-16 2.78e-04 2s 19 4.34218098e+01 2.39701041e+01 8.62e-01 8.10e-16 1.82e-04 2s 20 4.07980574e+01 3.03108827e+01 4.06e-01 6.80e-16 9.67e-05 2s 21 3.95048892e+01 3.46529654e+01 1.14e-01 6.54e-16 4.42e-05 2s 22 3.89708364e+01 3.71216940e+01 1.37e-02 8.00e-16 1.68e-05 2s 23 3.88569011e+01 3.79657511e+01 4.55e-03 7.39e-16 8.08e-06 2s 24 3.88208026e+01 3.82026522e+01 2.52e-03 1.03e-15 5.60e-06 2s 25 3.88026361e+01 3.84528714e+01 1.65e-03 6.91e-16 3.17e-06 2s 26 3.87781104e+01 3.84976153e+01 5.93e-04 8.88e-16 2.54e-06 2s 27 3.87736398e+01 3.85914499e+01 4.38e-04 6.95e-16 1.65e-06 2s 28 3.87666782e+01 3.86344024e+01 2.07e-04 9.00e-16 1.20e-06 2s 29 3.87631874e+01 3.87325629e+01 1.04e-04 8.61e-16 2.77e-07 2s 30 3.87591196e+01 3.87542926e+01 4.55e-07 6.66e-16 4.37e-08 2s 31 3.87590001e+01 3.87589973e+01 6.76e-11 6.66e-16 2.52e-11 2s 32 3.87590000e+01 3.87590000e+01 8.15e-13 6.16e-16 3.79e-17 3s Barrier solved model in 32 iterations and 2.52 seconds Optimal objective 3.87590000e+01 Root crossover log... 0 PPushes remaining with PInf 0.0000000e+00 5s Push phase complete: Pinf 0.0000000e+00, Dinf 2.4104210e+00 5s Root simplex log... Iteration Objective Primal Inf. Dual Inf. Time 42412 3.8759000e+01 0.000000e+00 0.000000e+00 5s 42412 3.8759000e+01 0.000000e+00 0.000000e+00 5s Root relaxation: objective 3.875900e+01, 42412 iterations, 5.21 seconds Total elapsed time = 18.98s Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 38.75900 0 172 171.00000 38.75900 77.3% - 19s H 0 0 41.0000000 38.75900 5.47% - 19s H 0 0 40.0000000 38.75900 3.10% - 20s 0 0 38.75900 0 295 40.00000 38.75900 3.10% - 29s 0 0 38.75900 0 368 40.00000 38.75900 3.10% - 39s 0 0 38.75900 0 353 40.00000 38.75900 3.10% - 48s 0 0 38.75900 0 383 40.00000 38.75900 3.10% - 63s 0 0 38.75900 0 119 40.00000 38.75900 3.10% - 113s H 0 0 39.0000000 38.75900 0.62% - 126s Explored 0 nodes (85398 simplex iterations) in 126.86 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.900000000000e+01, best bound 3.900000000000e+01, gap 0.0% Preprocessing time: 2.22 seconds Gurobi run time: 126.86 seconds Total run time: 129.08 seconds Objective: 39 Solution: 1 x [41, 46, 147, 149] 1 x [9, 13, 105, 115, 148] 1 x [9, 10, 89, 120, 146] 1 x [37, 39, 44, 119, 145] 1 x [46, 94, 116, 145] 1 x [34, 50, 52, 103, 145] 1 x [11, 36, 87, 101, 144] 1 x [4, 18, 80, 135, 143] 1 x [27, 96, 129, 143] 1 x [16, 16, 65, 140, 142] 1 x [15, 104, 137, 141] 1 x [43, 82, 127, 141] 1 x [2, 26, 30, 77, 95, 139] 1 x [64, 72, 121, 138] 1 x [5, 6, 22, 106, 114, 138] 1 x [28, 35, 45, 133, 137] 1 x [4, 17, 23, 79, 118, 137] 1 x [4, 54, 81, 118, 136] 1 x [4, 70, 82, 94, 134] 1 x [1, 80, 83, 86, 133] 1 x [9, 42, 50, 52, 82, 133] 1 x [7, 29, 40, 44, 125, 132] 1 x [57, 113, 115, 131] 1 x [73, 90, 110, 130] 1 x [21, 29, 51, 64, 78, 128] 1 x [57, 61, 62, 75, 126] 1 x [8, 20, 108, 111, 124] 1 x [4, 31, 74, 98, 123] 1 x [14, 33, 35, 67, 100, 122] 1 x [25, 56, 88, 100, 120] 1 x [12, 47, 57, 60, 82, 117] 1 x [24, 53, 105, 109, 115] 1 x [38, 56, 93, 98, 112] 1 x [3, 32, 49, 95, 102, 107] 1 x [30, 42, 42, 71, 85, 99] 1 x [17, 45, 58, 66, 91, 97] 1 x [57, 68, 76, 86, 92] 1 x [19, 55, 66, 69, 73, 84] 1 x [48, 59, 60, 63, 67, 69]