Build (method = -2) #dp: 36726 Step-3' Graph: 738 vertices and 4023 arcs (0.21s) Step-4' Graph: 641 vertices and 3829 arcs (0.21s) #V4/#V3 = 0.87 #A4/#A3 = 0.95 Ready! (0.21s) Optimize a model with 661 rows, 3830 columns and 10219 nonzeros Presolve removed 75 rows and 150 columns Presolve time: 0.06s Presolved: 586 rows, 3680 columns, 10104 nonzeros Variable types: 0 continuous, 3680 integer (9 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 586 rows, 3680 columns and 10104 nonzeros Presolved: 586 rows, 3680 columns, 10104 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.499e+03 Factor NZ : 3.366e+04 (roughly 2 MBytes of memory) Factor Ops : 3.121e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.62787923e+03 -8.77104930e+04 8.06e+04 1.41e-01 1.10e+02 0s 1 6.78714024e+02 -4.35334834e+04 1.23e+04 7.77e-16 1.96e+01 0s 2 3.74978640e+02 -1.97602854e+04 3.50e+03 1.55e-15 6.11e+00 0s 3 2.61505998e+02 -8.54358626e+03 9.99e+02 8.88e-16 2.02e+00 0s 4 2.07073334e+02 -2.97307860e+03 1.27e+02 3.55e-15 5.15e-01 0s 5 1.98480820e+02 -6.59804884e+02 1.84e-01 3.33e-15 1.16e-01 0s 6 1.85047945e+02 -4.87000001e+02 1.90e-02 2.66e-15 9.11e-02 0s 7 1.33868119e+02 -2.37498951e+02 1.07e-02 1.33e-15 5.03e-02 0s 8 8.59931717e+01 -1.09702078e+02 6.41e-03 4.44e-16 2.65e-02 0s 9 6.14951409e+01 -7.68765156e+01 4.34e-03 3.30e-16 1.88e-02 0s 10 5.13478656e+01 -5.50313839e+01 3.31e-03 2.50e-16 1.44e-02 0s 11 3.71858295e+01 -2.94601353e+01 1.83e-03 3.06e-16 9.03e-03 0s 12 3.02190621e+01 -1.07886581e+01 9.04e-04 2.40e-16 5.56e-03 0s 13 2.81297768e+01 4.77251892e+00 5.45e-04 2.28e-16 3.17e-03 0s 14 2.68140726e+01 1.89192126e+01 3.17e-04 3.11e-16 1.07e-03 0s 15 2.52104723e+01 2.43800572e+01 1.48e-07 2.22e-16 1.13e-04 0s 16 2.50009266e+01 2.49933708e+01 2.48e-10 3.33e-16 1.02e-06 0s 17 2.50000000e+01 2.50000000e+01 8.24e-14 2.73e-16 1.54e-12 0s Barrier solved model in 17 iterations and 0.09 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2510 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 7 200.00000 25.00000 87.5% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (3866 simplex iterations) in 0.38 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.23 seconds Gurobi run time: 0.38 seconds Total run time: 0.61 seconds Objective: 25 Solution: 1 x [5, 10, 13, 14, 16, 16, 16, 19] 2 x [2, 3, 5, 8, 11, 13, 14, 18] 3 x [2, 2, 5, 6, 10, 12, 13, 19] 3 x [14, 15, 16, 17, 18, 19, 19, 20] 1 x [3, 10, 10, 10, 11, 16, 16, 16] 1 x [3, 7, 7, 9, 11, 16, 16, 16] 1 x [3, 7, 7, 7, 16, 16, 16, 16] 3 x [2, 4, 5, 7, 7, 7, 12, 17] 1 x [2, 2, 6, 10, 15, 17, 17, 19] 1 x [2, 2, 6, 6, 10, 10, 14, 17] 2 x [1, 6, 6, 11, 12, 15, 18, 19] 1 x [6, 10, 11, 14, 14, 15, 15, 19] 4 x [5, 6, 8, 14, 14, 17, 18, 19] 1 x [1, 1, 1, 6, 6, 10, 14, 17]