Build (method = -2) #dp: 44410 Step-3' Graph: 827 vertices and 10078 arcs (0.32s) Step-4' Graph: 827 vertices and 10078 arcs (0.32s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.32s) Optimize a model with 847 rows, 10079 columns and 28592 nonzeros Presolve removed 28 rows and 52 columns Presolve time: 0.16s Presolved: 819 rows, 10027 columns, 28529 nonzeros Variable types: 0 continuous, 10027 integer (730 binary) Found heuristic solution: objective 167.0000000 Found heuristic solution: objective 149.0000000 Found heuristic solution: objective 147.0000000 Optimize a model with 819 rows, 10027 columns and 28529 nonzeros Presolved: 819 rows, 10027 columns, 28529 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.823e+04 Factor NZ : 1.145e+05 (roughly 5 MBytes of memory) Factor Ops : 2.224e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.90058031e+03 -2.70473891e+05 3.16e+05 3.76e-02 3.02e+02 0s 1 2.39409097e+03 -2.03115176e+05 4.37e+04 7.77e-16 4.86e+01 0s 2 1.23300159e+03 -1.00101733e+05 1.22e+04 1.12e-14 1.43e+01 0s 3 9.82666476e+02 -5.39781453e+04 4.19e+03 5.27e-15 5.41e+00 0s 4 7.22049417e+02 -2.30952709e+04 1.91e+03 3.38e-14 2.22e+00 0s 5 6.61082783e+02 -1.01767169e+04 1.23e+03 4.53e-14 1.12e+00 0s 6 6.09786755e+02 -4.98650314e+03 8.36e+02 4.49e-14 6.23e-01 0s 7 5.09236447e+02 -3.95615347e+03 4.29e+02 3.95e-14 3.95e-01 0s 8 4.67195362e+02 -3.29011644e+03 3.51e+02 3.42e-14 3.22e-01 0s 9 4.47917840e+02 -3.10600599e+03 3.23e+02 3.06e-14 3.00e-01 0s 10 3.81700495e+02 -1.51815155e+03 2.14e+02 1.38e-14 1.59e-01 0s 11 3.46433027e+02 -1.24399663e+03 1.71e+02 9.99e-15 1.27e-01 0s 12 2.50589497e+02 -6.13603723e+02 9.34e+01 1.15e-14 6.26e-02 0s 13 2.31390321e+02 -4.92081886e+02 6.44e+01 8.22e-15 4.78e-02 0s 14 2.29542604e+02 -4.62701029e+02 6.19e+01 8.44e-15 4.54e-02 0s 15 2.19627208e+02 -2.92383144e+02 4.71e+01 7.88e-15 3.18e-02 0s 16 2.06699975e+02 -1.56515736e+02 6.77e+00 6.72e-15 1.88e-02 0s 17 1.78688285e+02 -1.46864288e+02 4.91e+00 6.65e-15 1.68e-02 0s 18 1.69410015e+02 -9.67522984e+01 4.51e+00 7.53e-15 1.37e-02 0s 19 1.63771681e+02 -9.06336985e+01 4.33e+00 8.64e-15 1.31e-02 0s 20 1.52227667e+02 -8.06733018e+01 4.01e+00 9.59e-15 1.20e-02 0s 21 1.17109666e+02 -5.83241297e+01 3.06e+00 8.99e-15 9.02e-03 0s 22 1.10924430e+02 -4.51150534e+01 2.87e+00 8.64e-15 8.03e-03 0s 23 9.35980914e+01 -3.48254509e+01 2.37e+00 7.83e-15 6.60e-03 0s 24 7.80409344e+01 -1.95830703e+01 1.93e+00 6.44e-15 5.02e-03 0s 25 7.02485088e+01 -1.80334455e+01 1.72e+00 8.71e-15 4.54e-03 1s 26 5.46503983e+01 -5.49853744e+00 1.28e+00 6.07e-15 3.09e-03 1s 27 4.15834873e+01 -1.61966474e+00 8.86e-01 6.14e-15 2.21e-03 1s 28 2.89879733e+01 4.58555467e+00 4.87e-01 5.43e-15 1.24e-03 1s 29 2.42822599e+01 7.78970285e+00 3.43e-01 5.75e-15 8.40e-04 1s 30 2.13756202e+01 1.02625199e+01 2.37e-01 6.50e-15 5.65e-04 1s 31 2.10573894e+01 1.10841675e+01 2.12e-01 9.26e-15 5.06e-04 1s 32 1.96074963e+01 1.48431583e+01 6.69e-02 5.29e-15 2.40e-04 1s 33 1.90450789e+01 1.62087121e+01 4.03e-02 5.92e-15 1.43e-04 1s 34 1.88546950e+01 1.70476215e+01 3.05e-02 5.76e-15 9.09e-05 1s 35 1.85918505e+01 1.76386068e+01 1.88e-02 5.96e-15 4.80e-05 1s 36 1.83779125e+01 1.78687723e+01 8.53e-03 5.50e-15 2.56e-05 1s 37 1.83145851e+01 1.79851559e+01 5.54e-03 6.36e-15 1.65e-05 1s 38 1.82239627e+01 1.80706785e+01 1.18e-03 5.76e-15 7.66e-06 1s 39 1.82049468e+01 1.81411975e+01 3.87e-04 5.24e-15 3.18e-06 1s 40 1.82035751e+01 1.81587176e+01 3.34e-04 5.73e-15 2.24e-06 1s 41 1.81976658e+01 1.81738453e+01 9.56e-05 5.60e-15 1.19e-06 1s 42 1.81950280e+01 1.81946328e+01 1.65e-07 5.49e-15 1.97e-08 1s 43 1.81950000e+01 1.81949996e+01 7.78e-13 3.49e-15 2.06e-11 1s 44 1.81950000e+01 1.81950000e+01 1.54e-13 4.70e-15 2.06e-14 1s Barrier solved model in 44 iterations and 0.86 seconds Optimal objective 1.81950000e+01 Root relaxation: objective 1.819500e+01, 6925 iterations, 1.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 18.19500 0 107 147.00000 18.19500 87.6% - 3s H 0 0 20.0000000 18.19500 9.02% - 3s H 0 0 19.0000000 18.19500 4.24% - 3s Explored 0 nodes (13204 simplex iterations) in 3.23 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.38 seconds Gurobi run time: 3.23 seconds Total run time: 3.61 seconds Objective: 19 Solution: 1 x [2, 7, 8, 9, 10, 12, 12, 12, 14, 15, 17] 2 x [2, 8, 9, 9, 10, 12, 14, 15, 17] 1 x [1, 1, 2, 2, 3, 4, 7, 10, 10, 17, 20] 1 x [4, 4, 5, 5, 5, 9, 11, 12, 13, 14, 15] 1 x [1, 7, 10, 10, 13, 13, 13, 17, 20] 1 x [4, 8, 13, 13, 13, 16, 16, 19, 20] 1 x [1, 1, 4, 5, 6, 11, 12, 12, 12, 12, 15, 18, 20] 1 x [1, 1, 4, 6, 8, 10, 11, 11, 12, 16, 16, 16, 19] 3 x [6, 6, 6, 6, 14, 14] 1 x [5, 5, 7, 7, 7, 7, 8, 9, 14, 16, 17, 20] 1 x [4, 4, 4, 5, 8, 10, 11, 12, 14, 16, 17, 20] 1 x [5, 5, 7, 7, 8, 11, 14, 14, 16, 17, 20] 1 x [4, 4, 4, 7, 7, 7, 10, 10, 10, 10, 10, 10, 17, 20, 20] 2 x [1, 1, 1, 1, 4, 5, 7, 7, 8, 12, 12, 14, 14, 16, 20] 1 x [4, 4, 5, 9, 12, 12, 15]