Build (method = -2) #dp: 23996 Step-3' Graph: 319 vertices and 1283 arcs (0.14s) Step-4' Graph: 192 vertices and 1029 arcs (0.14s) #V4/#V3 = 0.60 #A4/#A3 = 0.80 Ready! (0.14s) Optimize a model with 211 rows, 1030 columns and 2715 nonzeros Presolve removed 37 rows and 76 columns Presolve time: 0.01s Presolved: 174 rows, 954 columns, 2605 nonzeros Variable types: 0 continuous, 954 integer (0 binary) Found heuristic solution: objective 186.0000000 Optimize a model with 174 rows, 954 columns and 2605 nonzeros Presolved: 174 rows, 954 columns, 2605 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.548e+03 Factor NZ : 4.524e+03 Factor Ops : 1.373e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.26349420e+03 -2.82827605e+04 3.10e+04 2.22e-16 1.04e+02 0s 1 7.71989138e+02 -8.99972539e+03 4.40e+03 1.89e-15 1.63e+01 0s 2 3.25219940e+02 -3.48082695e+03 8.23e+02 1.44e-15 3.74e+00 0s 3 2.16056448e+02 -7.25913241e+02 7.77e+01 9.44e-16 5.96e-01 0s 4 1.48964705e+02 -2.02615340e+02 2.00e+01 1.10e-15 1.99e-01 0s 5 1.05902599e+02 -1.26818771e+02 1.16e+01 1.77e-15 1.29e-01 0s 6 5.98691192e+01 -4.86861318e+01 5.43e+00 1.03e-15 5.97e-02 0s 7 3.82462787e+01 -1.67221433e+01 2.42e+00 1.12e-15 2.98e-02 0s 8 3.33289209e+01 -4.29476159e+00 1.33e+00 1.24e-15 2.01e-02 0s 9 3.13269769e+01 1.26326561e+01 7.65e-01 1.28e-15 9.98e-03 0s 10 3.11253362e+01 2.41175571e+01 4.78e-01 9.49e-16 3.75e-03 0s 11 2.88941579e+01 2.77343662e+01 3.37e-03 1.11e-15 6.02e-04 0s 12 2.85768876e+01 2.84940226e+01 4.88e-14 1.24e-15 4.30e-05 0s 13 2.85714303e+01 2.85714127e+01 2.30e-14 1.01e-15 9.12e-09 0s 14 2.85714286e+01 2.85714286e+01 4.14e-14 9.51e-16 1.09e-14 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 623 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 27 186.00000 28.57143 84.6% - 0s H 0 0 31.0000000 28.57143 7.83% - 0s H 0 0 30.0000000 28.57143 4.76% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1030 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.15 seconds Gurobi run time: 0.08 seconds Total run time: 0.22 seconds Objective: 29 Solution: 2 x [2, 6, 8, 9, 15, 18, 19] 6 x [3, 5, 6, 8, 12, 15, 19] 2 x [2, 2, 6, 11, 12, 15, 19] 3 x [1, 1, 2, 2, 2, 11, 19] 1 x [7, 7, 11, 12, 18, 18, 19] 1 x [1, 5, 6, 12, 13, 13, 14] 1 x [10, 10, 15, 16, 17, 18] 4 x [4, 4, 5, 10, 15, 17, 17] 1 x [10, 10, 15, 16, 17, 17, 18] 1 x [4, 5, 17, 17, 17] 2 x [4, 4, 4, 5, 17, 17, 17] 5 x [1, 6, 7, 7, 12, 14, 18]