Build (method = -2) #dp: 3764 Step-3' Graph: 136 vertices and 759 arcs (0.02s) Step-4' Graph: 100 vertices and 687 arcs (0.02s) #V4/#V3 = 0.74 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 120 rows, 688 columns and 1872 nonzeros Presolve removed 14 rows and 24 columns Presolve time: 0.01s Presolved: 106 rows, 664 columns, 1864 nonzeros Variable types: 0 continuous, 664 integer (0 binary) Found heuristic solution: objective 874.0000000 Found heuristic solution: objective 806.0000000 Optimize a model with 106 rows, 664 columns and 1864 nonzeros Presolved: 106 rows, 664 columns, 1864 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.060e+03 Factor NZ : 2.730e+03 Factor Ops : 8.182e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.50128064e+04 -6.60209516e+04 5.72e+04 2.22e-16 4.37e+02 0s 1 3.80416527e+03 -2.85482307e+04 7.88e+03 8.33e-16 6.96e+01 0s 2 1.32824300e+03 -9.76912478e+03 1.04e+03 3.44e-15 1.30e+01 0s 3 8.43735452e+02 -1.97850499e+03 5.65e+01 2.78e-15 2.25e+00 0s 4 5.11577568e+02 -8.33142545e+02 9.61e+00 8.88e-16 1.02e+00 0s 5 3.58712203e+02 -4.24824646e+02 5.57e+00 6.66e-16 5.91e-01 0s 6 2.56428757e+02 -1.99128352e+02 2.91e+00 6.67e-16 3.42e-01 0s 7 2.27357749e+02 -5.31165570e+00 1.48e+00 6.11e-16 1.74e-01 0s 8 2.19413632e+02 1.41527017e+02 6.04e-01 5.55e-16 5.81e-02 0s 9 2.03954197e+02 1.74155041e+02 1.70e-01 5.05e-16 2.22e-02 0s 10 1.95482244e+02 1.93791248e+02 3.69e-03 4.75e-16 1.26e-03 0s 11 1.95200483e+02 1.95198574e+02 2.65e-13 5.14e-16 1.42e-06 0s 12 1.95200000e+02 1.95199999e+02 2.11e-13 4.09e-16 1.42e-09 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 1.95200000e+02 Root relaxation: objective 1.952000e+02, 487 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 195.20000 0 25 806.00000 195.20000 75.8% - 0s H 0 0 199.0000000 195.20000 1.91% - 0s H 0 0 196.0000000 195.20000 0.41% - 0s Explored 0 nodes (818 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.960000000000e+02, best bound 1.960000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 196 Solution: 17 x [3, 7, 8, 13, 16] 7 x [10, 14, 16, 17, 17] 15 x [3, 6, 10, 11, 15] 22 x [3, 6, 14, 14, 15] 4 x [6, 10, 14, 17, 17] 25 x [4, 5, 6, 8, 19] 1 x [2, 6, 10, 14] 2 x [9, 11, 15, 17, 18] 1 x [9, 11, 17] 2 x [2, 10, 11, 15, 17] 1 x [10, 11, 13, 17, 17] 6 x [9, 11, 11, 11, 13] 1 x [1, 4, 11, 13] 3 x [4, 14, 19, 20, 20] 1 x [10, 11, 14, 15, 19] 11 x [2, 4, 4, 14, 20] 26 x [7, 9, 18, 20, 20] 11 x [4, 9, 12, 14, 18] 12 x [9, 11, 11, 14, 18] 28 x [1, 1, 1, 9, 18]