Build (method = -2) #dp: 145318 Step-3' Graph: 9935 vertices and 29798 arcs (1.59s) Step-4' Graph: 7955 vertices and 25838 arcs (1.63s) #V4/#V3 = 0.80 #A4/#A3 = 0.87 Ready! (1.63s) Optimize a model with 7992 rows, 25839 columns and 61611 nonzeros Presolve removed 419 rows and 756 columns Presolve time: 0.32s Presolved: 7573 rows, 25083 columns, 61365 nonzeros Variable types: 0 continuous, 25083 integer (0 binary) Found heuristic solution: objective 182.0000000 Optimize a model with 7573 rows, 25083 columns and 61365 nonzeros Presolved: 7573 rows, 25083 columns, 61365 nonzeros Root barrier log... Ordering time: 0.19s Barrier statistics: AA' NZ : 4.382e+04 Factor NZ : 1.558e+06 (roughly 26 MBytes of memory) Factor Ops : 9.478e+08 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.43417535e+04 -1.47851326e+06 5.32e+06 2.22e-16 7.24e+02 1s 1 1.93078744e+03 -1.18818761e+06 5.68e+05 1.78e-15 9.43e+01 1s 2 8.14650073e+02 -4.43015635e+05 1.09e+05 3.77e-15 1.96e+01 1s 3 5.21082979e+02 -1.46181346e+05 4.16e+04 4.00e-15 6.72e+00 1s 4 3.70312679e+02 -5.71060499e+04 1.69e+04 1.69e-14 2.82e+00 2s 5 2.89714097e+02 -4.74236172e+04 6.22e+03 1.87e-14 1.56e+00 2s 6 2.50240320e+02 -2.04412215e+04 1.69e+03 7.37e-14 5.74e-01 2s 7 2.31381692e+02 -2.05498310e+03 1.75e+02 2.75e-14 6.04e-02 3s 8 2.12660996e+02 -5.56380437e+02 1.24e+00 2.58e-14 1.54e-02 3s 9 1.98011842e+02 -3.21110647e+02 4.63e-01 1.73e-14 1.04e-02 3s 10 1.88277424e+02 -1.99883945e+02 2.78e-01 1.27e-14 7.74e-03 3s 11 1.55940294e+02 -1.59980974e+02 1.72e-01 1.04e-14 6.30e-03 4s 12 1.36032088e+02 -1.03000019e+02 1.33e-01 8.55e-15 4.76e-03 4s 13 1.09255569e+02 -7.97937876e+01 8.89e-02 7.99e-15 3.77e-03 4s 14 1.04503860e+02 -7.77648673e+01 8.29e-02 7.55e-15 3.63e-03 5s 15 9.08310301e+01 -6.54901717e+01 7.06e-02 6.66e-15 3.12e-03 5s 16 8.34293525e+01 -5.18491693e+01 6.38e-02 4.22e-15 2.70e-03 5s 17 7.49528108e+01 -3.63496475e+01 5.43e-02 3.11e-15 2.22e-03 6s 18 7.10661471e+01 -2.17040791e+01 4.95e-02 2.55e-15 1.85e-03 6s 19 6.46687683e+01 -6.89537256e+00 3.90e-02 2.01e-15 1.43e-03 6s 20 5.73209800e+01 1.35258538e+01 2.66e-02 1.83e-15 8.73e-04 6s 21 5.19077890e+01 2.85531007e+01 1.63e-02 1.62e-15 4.65e-04 7s 22 4.96578358e+01 3.47035125e+01 1.13e-02 1.49e-15 2.98e-04 7s 23 4.68515475e+01 4.10996349e+01 4.94e-03 1.83e-15 1.15e-04 7s 24 4.59689842e+01 4.33221208e+01 3.03e-03 1.46e-15 5.27e-05 8s 25 4.55183745e+01 4.40222196e+01 1.98e-03 1.76e-15 2.98e-05 8s 26 4.51555944e+01 4.42684363e+01 1.13e-03 1.94e-15 1.77e-05 8s 27 4.50107254e+01 4.44090558e+01 7.74e-04 2.07e-15 1.20e-05 9s 28 4.49018543e+01 4.45396077e+01 5.03e-04 1.68e-15 7.22e-06 9s 29 4.48650965e+01 4.46014129e+01 4.14e-04 1.62e-15 5.26e-06 9s 30 4.47546114e+01 4.46371047e+01 1.39e-04 1.53e-15 2.34e-06 10s 31 4.47062165e+01 4.46765753e+01 1.52e-05 1.35e-15 5.91e-07 10s 32 4.46991181e+01 4.46980611e+01 6.70e-08 1.63e-15 2.11e-08 10s 33 4.46990005e+01 4.46989980e+01 1.01e-12 1.45e-15 4.84e-11 11s 34 4.46990000e+01 4.46990000e+01 5.08e-13 1.37e-15 4.84e-14 11s Barrier solved model in 34 iterations and 10.84 seconds Optimal objective 4.46990000e+01 Root crossover log... 1201 DPushes remaining with DInf 0.0000000e+00 11s 0 DPushes remaining with DInf 5.3585030e+00 11s 8170 PPushes remaining with PInf 0.0000000e+00 11s 0 PPushes remaining with PInf 0.0000000e+00 12s Push phase complete: Pinf 0.0000000e+00, Dinf 5.3585030e+00 12s Root simplex log... Iteration Objective Primal Inf. Dual Inf. Time 9373 4.4699000e+01 0.000000e+00 0.000000e+00 12s 9373 4.4699000e+01 0.000000e+00 0.000000e+00 12s Root relaxation: objective 4.469900e+01, 9373 iterations, 11.72 seconds Total elapsed time = 19.82s Total elapsed time = 24.39s Total elapsed time = 27.07s Total elapsed time = 31.63s Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 44.69900 0 324 182.00000 44.69900 75.4% - 35s H 0 0 46.0000000 44.69900 2.83% - 35s H 0 0 45.0000000 44.69900 0.67% - 36s Explored 0 nodes (36034 simplex iterations) in 36.65 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.500000000000e+01, best bound 4.500000000000e+01, gap 0.0% Preprocessing time: 1.75 seconds Gurobi run time: 36.65 seconds Total run time: 38.40 seconds Objective: 45 Solution: 1 x [1, 2, 8, 11, 13, 17, 35] 1 x [1, 2, 8, 11, 13, 19, 31] 2 x [1, 2, 8, 12, 14, 17, 34] 1 x [1, 2, 9, 12, 13, 24, 26] 1 x [1, 3, 5, 11, 12, 14] 3 x [1, 3, 12, 17, 19, 23, 30, 31, 35, 36] 2 x [1, 5, 6, 12, 14, 19, 34, 36] 5 x [1, 5, 8, 9, 12, 13] 1 x [1, 6, 8, 19, 22, 28, 34, 37] 1 x [1, 6, 13, 15, 17, 23, 25, 27] 1 x [1, 6, 18, 21, 23, 24, 25, 27, 30, 34] 1 x [2, 3, 9, 10, 11, 23, 34, 36] 2 x [2, 5, 8, 9, 14, 19, 31] 1 x [2, 5, 8, 17, 20, 24, 29, 30, 34] 3 x [2, 6, 11, 12, 15, 20, 23, 36] 3 x [2, 12, 13, 14, 22, 23, 26, 30, 31, 36, 37] 3 x [3, 9, 11, 14, 16, 17, 22, 36] 1 x [3, 9, 11, 14, 16, 17, 28, 34, 37] 1 x [3, 9, 11, 14, 16, 23, 26, 32, 35] 2 x [4, 9, 11, 12, 13, 14, 32, 35] 2 x [6, 7, 11, 12, 17, 25, 27, 30, 34] 1 x [10, 11, 16, 17, 20, 29, 30, 31, 34, 36, 37] 1 x [10, 16, 19, 21, 22, 25, 26, 27, 29, 30, 31, 34, 37] 1 x [13, 16, 18, 20, 21, 22, 23, 29, 30, 31, 33, 37] 1 x [13, 16, 18, 20, 22, 25, 26, 27, 29, 30, 31, 34, 37] 1 x [15, 18, 19, 21, 22, 23, 26, 27, 29, 30, 31, 33, 35, 37] 2 x [17, 18, 19, 21, 23, 25, 27, 29, 30, 31, 32, 33, 34, 35, 36]