Build (method = -2) #dp: 50919 Step-3' Graph: 863 vertices and 9010 arcs (0.38s) Step-4' Graph: 861 vertices and 9006 arcs (0.38s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.38s) Optimize a model with 878 rows, 9007 columns and 25373 nonzeros Presolve removed 31 rows and 58 columns Presolve time: 0.12s Presolved: 847 rows, 8949 columns, 25293 nonzeros Variable types: 0 continuous, 8949 integer (0 binary) Found heuristic solution: objective 2000.0000000 Found heuristic solution: objective 1859.0000000 Optimize a model with 847 rows, 8949 columns and 25293 nonzeros Presolved: 847 rows, 8949 columns, 25293 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.652e+04 Factor NZ : 1.273e+05 (roughly 5 MBytes of memory) Factor Ops : 2.925e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.53457599e+04 -2.28804478e+06 1.20e+06 1.11e-16 1.38e+03 0s 1 5.68601684e+03 -1.65516122e+06 1.63e+05 7.77e-16 2.53e+02 0s 2 3.86432879e+03 -1.00215000e+06 6.61e+04 8.88e-16 1.13e+02 0s 3 2.79125000e+03 -3.77142917e+05 2.45e+04 5.33e-15 3.83e+01 0s 4 2.15106641e+03 -9.78830461e+04 4.66e+03 4.26e-14 8.49e+00 0s 5 1.99807476e+03 -2.45938617e+04 7.97e+01 4.80e-14 1.52e+00 0s 6 1.99171529e+03 -3.38309385e+03 4.81e-01 8.44e-15 3.00e-01 0s 7 1.87741454e+03 -3.01134545e+03 1.02e-03 7.66e-15 2.73e-01 0s 8 1.58999132e+03 -2.69857697e+03 7.39e-04 7.11e-15 2.39e-01 0s 9 1.48977945e+03 -2.29889030e+03 6.81e-04 5.88e-15 2.12e-01 0s 10 1.01339655e+03 -1.84860807e+03 4.34e-04 4.88e-15 1.60e-01 0s 11 6.58944720e+02 -8.69258786e+02 2.41e-04 2.44e-15 8.53e-02 0s 12 4.50888669e+02 -5.06509525e+02 1.31e-04 1.55e-15 5.34e-02 0s 13 3.39343461e+02 -1.76163436e+02 7.69e-05 8.88e-16 2.88e-02 0s 14 2.82092851e+02 -1.20572378e+02 4.46e-05 6.66e-16 2.25e-02 0s 15 2.41546309e+02 3.39579526e+01 2.50e-05 3.33e-16 1.16e-02 0s 16 2.17308968e+02 1.22350896e+02 1.08e-05 2.22e-16 5.30e-03 0s 17 2.12228131e+02 1.70609028e+02 7.47e-06 2.30e-16 2.32e-03 1s 18 2.11245150e+02 1.74896460e+02 6.70e-06 2.22e-16 2.03e-03 1s 19 2.07442450e+02 1.80485901e+02 3.62e-06 2.22e-16 1.50e-03 1s 20 2.05634691e+02 1.91352449e+02 2.01e-06 2.22e-16 7.97e-04 1s 21 2.04688205e+02 1.96983389e+02 1.01e-06 2.01e-16 4.30e-04 1s 22 2.04459161e+02 2.00087579e+02 8.26e-07 2.21e-16 2.44e-04 1s 23 2.03770316e+02 2.01135145e+02 2.84e-07 2.91e-16 1.47e-04 1s 24 2.03529823e+02 2.02746305e+02 1.11e-07 2.79e-16 4.37e-05 1s 25 2.03401216e+02 2.03057475e+02 2.42e-08 2.22e-16 1.92e-05 1s 26 2.03371924e+02 2.03250467e+02 5.78e-09 3.09e-16 6.78e-06 1s 27 2.03361599e+02 2.03357988e+02 2.30e-10 3.59e-16 2.02e-07 1s 28 2.03361001e+02 2.03360997e+02 1.04e-11 4.07e-16 2.02e-10 1s 29 2.03361000e+02 2.03361000e+02 2.50e-11 3.01e-16 2.02e-13 1s Barrier solved model in 29 iterations and 0.79 seconds Optimal objective 2.03361000e+02 Root relaxation: objective 2.033610e+02, 6169 iterations, 0.98 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 203.36100 0 66 1859.00000 203.36100 89.1% - 2s H 0 0 204.0000000 203.36100 0.31% - 2s Explored 0 nodes (12766 simplex iterations) in 2.89 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.040000000000e+02, best bound 2.040000000000e+02, gap 0.0% Preprocessing time: 0.43 seconds Gurobi run time: 2.89 seconds Total run time: 3.32 seconds Objective: 204 Solution: 16 x [1, 3, 5, 6, 6, 8, 11, 13, 13, 14, 14] 7 x [2, 2, 3, 3, 5, 8, 16] 36 x [4, 5, 8, 8, 16, 16, 17] 13 x [1, 3, 5, 6, 6, 6, 7, 9, 14, 14, 14, 15, 15, 16] 6 x [1, 3, 4, 4, 5, 6, 7, 9, 9, 13, 14, 14, 14, 15, 15] 1 x [1, 5, 5, 6, 14, 15, 17] 2 x [1, 3, 5, 5, 6, 14, 15, 17, 17] 1 x [1, 5, 5, 6, 14, 15, 17, 17] 25 x [3, 5, 5, 9, 9, 9, 9, 12, 13, 13, 16] 7 x [3, 5, 5, 6, 12, 13, 13, 14, 14, 15] 1 x [5, 5, 5, 8, 13, 15] 22 x [8, 10, 10, 10, 14, 15, 17, 17] 7 x [7, 8, 8, 15, 15, 15, 15, 17, 17] 2 x [1, 4, 6, 8, 8, 13, 14, 14, 15, 15, 15, 16] 1 x [1, 4, 8, 8, 13, 14, 14, 15, 15, 15, 16] 4 x [8, 8, 8, 8, 17, 17] 14 x [1, 1, 2, 6, 6, 7, 10, 10, 10, 16] 39 x [1, 2, 2, 2, 2, 4, 4, 6, 7, 9, 13]