Build (method = -2) #dp: 21796 Step-3' Graph: 362 vertices and 1530 arcs (0.12s) Step-4' Graph: 275 vertices and 1357 arcs (0.12s) #V4/#V3 = 0.76 #A4/#A3 = 0.89 Ready! (0.12s) Optimize a model with 294 rows, 1358 columns and 3533 nonzeros Presolve removed 71 rows and 128 columns Presolve time: 0.02s Presolved: 223 rows, 1230 columns, 3397 nonzeros Variable types: 0 continuous, 1230 integer (127 binary) Found heuristic solution: objective 151.0000000 Optimize a model with 223 rows, 1230 columns and 3397 nonzeros Presolved: 223 rows, 1230 columns, 3397 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.025e+03 Factor NZ : 7.069e+03 Factor Ops : 2.839e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.32284257e+03 -3.05581262e+04 4.17e+04 6.98e-02 1.26e+02 0s 1 8.32733711e+02 -1.36903909e+04 6.72e+03 1.22e-15 2.23e+01 0s 2 2.97345963e+02 -4.58387586e+03 1.07e+03 8.88e-16 4.16e+00 0s 3 1.99425493e+02 -1.05492751e+03 9.21e+01 1.33e-15 6.42e-01 0s 4 1.48342988e+02 -3.38040527e+02 1.68e+01 9.99e-16 2.12e-01 0s 5 1.22074547e+02 -1.67601576e+02 1.20e+01 6.57e-16 1.26e-01 0s 6 8.35897488e+01 -1.09857516e+02 7.43e+00 7.95e-16 8.33e-02 0s 7 5.87131526e+01 -5.42652687e+01 4.61e+00 6.73e-16 4.84e-02 0s 8 3.70048964e+01 -1.07919950e+01 1.57e+00 6.15e-16 2.01e-02 0s 9 3.18210695e+01 1.73699334e+01 6.25e-01 4.83e-16 6.04e-03 0s 10 3.15058242e+01 2.22103573e+01 5.50e-01 7.77e-16 3.89e-03 0s 11 3.01634469e+01 2.73945543e+01 3.17e-01 5.55e-16 1.17e-03 0s 12 2.85874772e+01 2.84746628e+01 9.96e-14 5.70e-16 4.55e-05 0s 13 2.85714299e+01 2.85714109e+01 1.81e-13 5.55e-16 7.64e-09 0s 14 2.85714286e+01 2.85714286e+01 6.07e-14 5.59e-16 7.64e-12 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 808 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 32 151.00000 28.57143 81.1% - 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 (1154 simplex iterations) in 0.09 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.13 seconds Gurobi run time: 0.09 seconds Total run time: 0.22 seconds Objective: 29 Solution: 9 x [5, 9, 11, 11, 12, 13, 17] 3 x [1, 5, 11, 11, 15, 16, 16] 2 x [3, 5, 6, 9, 10, 12, 12] 1 x [4, 5, 10, 18, 18] 1 x [5, 5, 9, 11, 11, 18, 18] 1 x [1, 8, 12, 16, 17, 17, 19] 3 x [2, 2, 4, 9, 12, 19, 19] 2 x [11, 12, 16, 16, 17, 18, 18] 6 x [1, 1, 4, 4, 6, 7, 16] 1 x [1, 9, 11, 14, 16, 18]