Build (method = -2) #dp: 37975 Step-3' Graph: 633 vertices and 3407 arcs (0.24s) Step-4' Graph: 504 vertices and 3149 arcs (0.24s) #V4/#V3 = 0.80 #A4/#A3 = 0.92 Ready! (0.24s) Optimize a model with 523 rows, 3150 columns and 8453 nonzeros Presolve removed 72 rows and 142 columns Presolve time: 0.05s Presolved: 451 rows, 3008 columns, 8368 nonzeros Variable types: 0 continuous, 3008 integer (0 binary) Found heuristic solution: objective 1492.0000000 Optimize a model with 451 rows, 3008 columns and 8368 nonzeros Presolved: 451 rows, 3008 columns, 8368 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.127e+03 Factor NZ : 1.951e+04 (roughly 2 MBytes of memory) Factor Ops : 1.169e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.89479237e+04 -7.57633553e+05 8.53e+05 2.22e-16 1.19e+03 0s 1 7.16227903e+03 -3.47819695e+05 1.28e+05 7.77e-16 2.03e+02 0s 2 3.70584021e+03 -1.45623448e+05 3.55e+04 1.42e-14 6.02e+01 0s 3 2.42207230e+03 -5.53482668e+04 8.19e+03 1.33e-14 1.67e+01 0s 4 2.06517159e+03 -2.41780788e+04 1.60e+03 8.22e-15 5.51e+00 0s 5 1.98150785e+03 -6.01169805e+03 1.97e+02 4.22e-15 1.40e+00 0s 6 1.64805665e+03 -4.28826839e+03 1.67e-01 3.44e-15 9.84e-01 0s 7 1.26767580e+03 -2.37635946e+03 1.14e-01 1.67e-15 6.04e-01 0s 8 7.77435595e+02 -1.41728319e+03 5.65e-02 8.88e-16 3.64e-01 0s 9 4.51543334e+02 -3.62606039e+02 2.60e-02 4.44e-16 1.35e-01 0s 10 3.65214564e+02 -9.91821755e+01 1.73e-02 3.99e-16 7.70e-02 0s 11 3.05329588e+02 -7.97838918e+00 1.07e-02 4.63e-16 5.19e-02 0s 12 2.95170829e+02 9.60157643e+01 8.07e-03 3.44e-16 3.30e-02 0s 13 2.80727246e+02 1.63309249e+02 4.70e-03 3.16e-16 1.95e-02 0s 14 2.69317402e+02 2.18645963e+02 3.03e-03 4.44e-16 8.40e-03 0s 15 2.55805804e+02 2.44547590e+02 1.01e-03 3.24e-16 1.87e-03 0s 16 2.50200225e+02 2.49727057e+02 1.58e-11 4.06e-16 7.84e-05 0s 17 2.50000130e+02 2.49998783e+02 4.54e-13 4.44e-16 2.23e-07 0s 18 2.50000000e+02 2.50000000e+02 1.93e-12 3.33e-16 2.64e-13 0s Barrier solved model in 18 iterations and 0.06 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 1938 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 250.00000 0 54 1492.00000 250.00000 83.2% - 0s H 0 0 251.0000000 250.00000 0.40% - 0s H 0 0 250.0000000 250.00000 0.0% - 0s Explored 0 nodes (3421 simplex iterations) in 0.35 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0% Preprocessing time: 0.26 seconds Gurobi run time: 0.35 seconds Total run time: 0.61 seconds Objective: 250 Solution: 3 x [5, 6, 10, 11, 15, 16, 17, 19] 2 x [10, 10, 11, 15, 17, 18, 18, 19] 14 x [1, 1, 11, 14, 15, 16, 17, 19] 15 x [1, 2, 2, 2, 8, 10, 12, 19] 22 x [4, 4, 4, 5, 6, 15, 15, 19] 41 x [5, 6, 6, 7, 12, 14, 18, 19] 21 x [3, 3, 3, 5, 7, 17, 19, 19] 17 x [2, 7, 10, 11, 12, 12, 13, 18] 1 x [1, 1, 2, 2, 8, 10, 14, 17] 1 x [1, 1, 10, 10, 11, 15, 17, 18] 7 x [7, 10, 11, 14, 15, 17, 17, 18] 20 x [1, 4, 9, 15, 17, 17, 18, 18] 3 x [4, 5, 6, 15, 15, 15, 17, 17] 1 x [4, 11, 15, 15, 15, 15, 17, 17] 26 x [4, 4, 5, 6, 15, 15, 17, 17] 20 x [1, 2, 5, 6, 11, 12, 17, 17] 2 x [1, 4, 4, 10, 14, 15, 15, 15] 34 x [1, 2, 2, 7, 8, 8, 10, 12]