Build (method = -2) #dp: 4951 Step-3' Graph: 158 vertices and 835 arcs (0.02s) Step-4' Graph: 121 vertices and 761 arcs (0.03s) #V4/#V3 = 0.77 #A4/#A3 = 0.91 Ready! (0.03s) Optimize a model with 141 rows, 762 columns and 2052 nonzeros Presolve removed 13 rows and 23 columns Presolve time: 0.01s Presolved: 128 rows, 739 columns, 2044 nonzeros Variable types: 0 continuous, 739 integer (0 binary) Found heuristic solution: objective 842.0000000 Optimize a model with 128 rows, 739 columns and 2044 nonzeros Presolved: 128 rows, 739 columns, 2044 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.278e+03 Factor NZ : 3.543e+03 Factor Ops : 1.230e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.03664726e+04 -6.30742606e+04 5.08e+04 2.22e-16 3.08e+02 0s 1 2.96107328e+03 -2.36769600e+04 8.38e+03 5.55e-16 5.55e+01 0s 2 1.11713176e+03 -8.20348318e+03 9.06e+02 4.05e-15 9.44e+00 0s 3 7.06174423e+02 -1.71037199e+03 5.83e+01 3.22e-15 1.74e+00 0s 4 3.94407780e+02 -8.62739599e+02 1.23e+01 2.30e-15 8.59e-01 0s 5 2.89202250e+02 -4.06913086e+02 5.87e+00 2.39e-15 4.72e-01 0s 6 2.43677672e+02 -6.58307019e+01 3.19e+00 2.06e-15 2.10e-01 0s 7 2.20514402e+02 1.06171128e+02 1.23e+00 1.69e-15 7.71e-02 0s 8 2.15055367e+02 2.00415466e+02 7.78e-01 2.65e-15 1.00e-02 0s 9 2.08041916e+02 2.07251131e+02 8.33e-04 1.66e-15 5.28e-04 0s 10 2.07800245e+02 2.07799299e+02 1.28e-12 2.22e-15 6.31e-07 0s 11 2.07800000e+02 2.07799999e+02 6.08e-13 2.17e-15 6.31e-10 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 2.07800000e+02 Root relaxation: objective 2.078000e+02, 518 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 207.80000 0 31 842.00000 207.80000 75.3% - 0s H 0 0 209.0000000 207.80000 0.57% - 0s 0 0 207.80000 0 44 209.00000 207.80000 0.57% - 0s 0 0 207.80000 0 42 209.00000 207.80000 0.57% - 0s H 0 0 208.0000000 207.80000 0.10% - 0s Cutting planes: Gomory: 1 Zero half: 3 Explored 0 nodes (858 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.080000000000e+02, best bound 2.080000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 208 Solution: 47 x [1, 2, 6, 13, 16] 10 x [2, 5, 11, 11, 14] 16 x [13, 14, 14, 18, 20] 3 x [6, 8, 12, 16, 20] 29 x [3, 6, 11, 12, 17] 13 x [3, 6, 11, 11, 14] 2 x [10, 12, 14, 16, 20] 24 x [5, 10, 14, 15, 15] 1 x [9, 10, 14, 15, 15] 1 x [4, 5, 8, 12, 13] 7 x [4, 4, 12, 16, 20] 1 x [5, 8, 9, 9, 14] 43 x [5, 7, 8, 9, 9] 9 x [3, 8, 11, 11, 19] 1 x [8, 13, 20, 20, 20] 1 x [4, 4, 7, 15]