Build (method = -2) #dp: 54984 Step-3' Graph: 1679 vertices and 11906 arcs (0.38s) Step-4' Graph: 1602 vertices and 11757 arcs (0.39s) #V4/#V3 = 0.95 #A4/#A3 = 0.99 Ready! (0.39s) Optimize a model with 1620 rows, 11758 columns and 32079 nonzeros Presolve removed 115 rows and 223 columns Presolve time: 0.14s Presolved: 1505 rows, 11535 columns, 32047 nonzeros Variable types: 0 continuous, 11535 integer (397 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 1505 rows, 11535 columns and 32047 nonzeros Presolved: 1505 rows, 11535 columns, 32047 nonzeros Root barrier log... Ordering time: 0.06s Barrier statistics: AA' NZ : 2.011e+04 Factor NZ : 1.788e+05 (roughly 7 MBytes of memory) Factor Ops : 3.623e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.77310448e+03 -3.12986625e+05 2.81e+05 2.22e-16 1.77e+02 0s 1 8.56463312e+02 -2.16563199e+05 3.89e+04 1.55e-15 3.08e+01 0s 2 5.03479258e+02 -1.36125714e+05 1.39e+04 1.44e-15 1.30e+01 0s 3 3.08754598e+02 -5.97241515e+04 4.63e+03 3.46e-14 4.66e+00 0s 4 2.20241875e+02 -1.77874075e+04 7.30e+02 3.11e-14 1.07e+00 0s 5 2.07020221e+02 -7.83151229e+03 1.90e+02 2.04e-14 4.14e-01 0s 6 2.04120654e+02 -3.32169179e+03 6.47e+01 1.15e-14 1.69e-01 0s 7 2.01995157e+02 -2.62988609e+03 2.77e+01 8.44e-15 1.29e-01 0s 8 2.00306876e+02 -1.72799467e+03 1.74e+01 5.22e-15 8.64e-02 0s 9 1.98582057e+02 -8.23246473e+02 8.34e+00 2.33e-15 4.51e-02 0s 10 1.79755496e+02 -6.80978555e+02 8.59e-01 2.22e-15 3.74e-02 0s 11 1.30509764e+02 -5.12239407e+02 5.58e-01 1.55e-15 2.79e-02 0s 12 8.27138516e+01 -1.62001006e+02 2.71e-01 6.66e-16 1.06e-02 0s 13 3.75342617e+01 -6.08348278e+01 1.09e-01 3.45e-16 4.27e-03 0s 14 3.52281730e+01 -4.21927723e+01 9.82e-02 3.75e-16 3.36e-03 0s 15 2.60829540e+01 -1.71533803e+01 4.65e-02 3.58e-16 1.88e-03 0s 16 2.35694574e+01 -2.96533322e+00 2.99e-02 3.46e-16 1.15e-03 1s 17 2.19820775e+01 6.86247322e+00 2.27e-02 3.33e-16 6.56e-04 1s 18 2.08047781e+01 9.49896896e+00 1.49e-02 2.84e-16 4.90e-04 1s 19 1.92765489e+01 1.42217836e+01 6.20e-03 2.70e-16 2.19e-04 1s 20 1.84865358e+01 1.65120467e+01 1.90e-03 2.85e-16 8.56e-05 1s 21 1.81879263e+01 1.79222915e+01 3.07e-05 3.02e-16 1.15e-05 1s 22 1.81818468e+01 1.81817083e+01 5.73e-10 3.94e-16 6.00e-09 1s 23 1.81818182e+01 1.81818182e+01 2.34e-11 3.33e-16 6.11e-15 1s Barrier solved model in 23 iterations and 0.67 seconds Optimal objective 1.81818182e+01 Root relaxation: objective 1.818182e+01, 7372 iterations, 0.84 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 18.18182 0 77 200.00000 18.18182 90.9% - 3s H 0 0 19.0000000 18.18182 4.31% - 3s Explored 0 nodes (17060 simplex iterations) in 3.63 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.43 seconds Gurobi run time: 3.63 seconds Total run time: 4.07 seconds Objective: 19 Solution: 2 x [3, 7, 9, 10, 10, 11, 12, 14, 14, 15, 15] 1 x [2, 5, 5, 6, 7, 7, 10, 10, 12, 13, 13] 1 x [2, 7, 7, 7, 10, 10, 11, 11, 15, 15, 18] 2 x [4, 8, 9, 10, 10, 11, 11, 12, 14, 15, 17] 1 x [2, 6, 8, 10, 10, 11, 11, 13, 15] 2 x [2, 3, 3, 3, 4, 6, 8, 8, 11, 15, 15] 1 x [2, 4, 5, 6, 6, 8, 8, 10, 10, 18, 18] 1 x [1, 9, 10, 10, 11, 11, 14, 14, 14, 15] 1 x [9, 9, 11, 13, 14, 15] 1 x [5, 5, 9, 9, 10, 10, 12, 13, 13, 16] 6 x [4, 4, 5, 5, 10, 10, 12, 13, 13, 14, 16]