Build (method = -2) #dp: 8056 Step-3' Graph: 229 vertices and 1201 arcs (0.04s) Step-4' Graph: 182 vertices and 1107 arcs (0.04s) #V4/#V3 = 0.79 #A4/#A3 = 0.92 Ready! (0.04s) Optimize a model with 202 rows, 1108 columns and 2969 nonzeros Presolve removed 26 rows and 49 columns Presolve time: 0.01s Presolved: 176 rows, 1059 columns, 2931 nonzeros Variable types: 0 continuous, 1059 integer (0 binary) Found heuristic solution: objective 866.0000000 Optimize a model with 176 rows, 1059 columns and 2931 nonzeros Presolved: 176 rows, 1059 columns, 2931 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.899e+03 Factor NZ : 5.745e+03 Factor Ops : 2.371e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.24952083e+04 -1.15215222e+05 9.91e+04 2.22e-16 4.34e+02 0s 1 3.50852344e+03 -4.89910421e+04 1.65e+04 6.66e-16 8.00e+01 0s 2 1.40173928e+03 -1.74876739e+04 2.75e+03 8.88e-16 1.65e+01 0s 3 9.23575092e+02 -4.23893701e+03 2.18e+02 4.88e-15 2.84e+00 0s 4 6.90075730e+02 -1.78268029e+03 1.21e+01 1.33e-15 1.17e+00 0s 5 5.10552731e+02 -8.82613660e+02 7.52e+00 8.88e-16 6.59e-01 0s 6 3.92801327e+02 -4.54305738e+02 4.88e+00 4.44e-16 4.00e-01 0s 7 2.48180036e+02 -1.80215735e+02 2.40e+00 5.55e-16 2.02e-01 0s 8 2.16920012e+02 6.31266027e+01 1.75e+00 3.45e-16 7.29e-02 0s 9 1.76304977e+02 1.24773264e+02 3.78e-01 3.43e-16 2.43e-02 0s 10 1.67532271e+02 1.62727997e+02 7.96e-13 3.33e-16 2.25e-03 0s 11 1.65364190e+02 1.65273304e+02 7.72e-13 3.33e-16 4.25e-05 0s 12 1.65333333e+02 1.65333331e+02 2.86e-13 3.19e-16 1.04e-09 0s 13 1.65333333e+02 1.65333333e+02 4.32e-13 3.33e-16 1.90e-15 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.65333333e+02 Root relaxation: objective 1.653333e+02, 727 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 165.33333 0 38 866.00000 165.33333 80.9% - 0s H 0 0 166.0000000 165.33333 0.40% - 0s Explored 0 nodes (1033 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.660000000000e+02, best bound 1.660000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 166 Solution: 2 x [2, 9, 11, 13, 14, 17] 8 x [9, 9, 14, 15, 15, 17] 37 x [1, 8, 9, 11, 13, 17] 14 x [3, 3, 5, 7, 10, 18] 4 x [1, 3, 5, 10, 18, 20] 17 x [1, 3, 5, 8, 13, 20] 27 x [11, 15, 15, 19, 20, 20] 2 x [2, 4, 13, 13, 16, 20] 13 x [2, 3, 4, 11, 12, 12] 1 x [1, 2, 13, 16, 20] 2 x [1, 2, 7, 9, 16, 16] 23 x [7, 13, 16, 16, 18, 18] 4 x [1, 1, 7, 9, 9, 10] 11 x [6, 7, 7, 15, 15, 20] 1 x [1, 2, 20]