Build (method = -2) #dp: 14438 Step-3' Graph: 360 vertices and 1749 arcs (0.08s) Step-4' Graph: 270 vertices and 1569 arcs (0.08s) #V4/#V3 = 0.75 #A4/#A3 = 0.90 Ready! (0.08s) Optimize a model with 287 rows, 1570 columns and 4180 nonzeros Presolve removed 23 rows and 42 columns Presolve time: 0.01s Presolved: 264 rows, 1528 columns, 4144 nonzeros Variable types: 0 continuous, 1528 integer (0 binary) Found heuristic solution: objective 162.0000000 Optimize a model with 264 rows, 1528 columns and 4144 nonzeros Presolved: 264 rows, 1528 columns, 4144 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.521e+03 Factor NZ : 8.741e+03 Factor Ops : 3.769e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.68806093e+03 -4.20199886e+04 3.88e+04 2.22e-16 1.21e+02 0s 1 6.20309689e+02 -2.14669596e+04 4.85e+03 7.77e-16 1.91e+01 0s 2 3.31942105e+02 -8.60427908e+03 1.24e+03 8.88e-16 5.42e+00 0s 3 2.19472213e+02 -2.30219079e+03 1.90e+02 4.44e-15 1.11e+00 0s 4 1.97119807e+02 -6.42979981e+02 4.31e+00 2.44e-15 2.77e-01 0s 5 1.50697386e+02 -4.04429492e+02 9.38e-13 1.55e-15 1.81e-01 0s 6 8.63990681e+01 -1.74522908e+02 4.49e-13 9.99e-16 8.49e-02 0s 7 6.67621989e+01 -1.03563228e+02 2.60e-13 7.77e-16 5.54e-02 0s 8 4.61401998e+01 -5.50605992e+01 1.42e-13 6.45e-16 3.29e-02 0s 9 3.75850574e+01 -8.12435076e+00 1.00e-13 5.39e-16 1.49e-02 0s 10 3.40198198e+01 8.68353880e+00 7.51e-14 6.15e-16 8.24e-03 0s 11 3.18068633e+01 1.74566808e+01 5.98e-14 5.31e-16 4.67e-03 0s 12 2.88842988e+01 2.63618524e+01 2.29e-13 6.00e-16 8.21e-04 0s 13 2.86143243e+01 2.85158126e+01 4.10e-13 4.57e-16 3.21e-05 0s 14 2.85714717e+01 2.85713731e+01 5.36e-14 4.46e-16 3.21e-08 0s 15 2.85714286e+01 2.85714286e+01 8.50e-14 3.93e-16 3.23e-14 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 1068 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 23 162.00000 28.57143 82.4% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (2490 simplex iterations) in 0.14 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.09 seconds Gurobi run time: 0.14 seconds Total run time: 0.23 seconds Objective: 29 Solution: 10 x [1, 1, 2, 3, 4, 6, 13] 1 x [1, 5, 6, 6, 10, 14, 16] 1 x [4, 5, 7, 8, 9, 14, 16] 8 x [5, 7, 8, 14, 15, 16, 17] 2 x [5, 8, 9, 11, 14, 16, 16] 1 x [1, 5, 8, 10, 13, 14] 2 x [1, 4, 5, 11, 13, 13, 14] 1 x [1, 1, 5, 5, 6, 13, 14] 1 x [8, 11, 12, 12, 16] 1 x [8, 11, 11, 12, 12, 12, 16] 1 x [10, 10, 10, 10, 10, 10, 10]