Build (method = -2) #dp: 16505 Step-3' Graph: 579 vertices and 3231 arcs (0.10s) Step-4' Graph: 476 vertices and 3028 arcs (0.10s) #V4/#V3 = 0.82 #A4/#A3 = 0.94 Ready! (0.10s) Optimize a model with 493 rows, 3029 columns and 8143 nonzeros Presolve removed 74 rows and 143 columns Presolve time: 0.03s Presolved: 419 rows, 2886 columns, 7940 nonzeros Variable types: 0 continuous, 2886 integer (0 binary) Found heuristic solution: objective 115.0000000 Optimize a model with 419 rows, 2886 columns and 7940 nonzeros Presolved: 419 rows, 2886 columns, 7940 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.308e+03 Factor NZ : 1.336e+04 (roughly 1 MByte of memory) Factor Ops : 5.062e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.88691532e+03 -6.31191859e+04 4.66e+04 1.11e-16 7.57e+01 0s 1 5.44582330e+02 -3.67292834e+04 7.47e+03 5.55e-16 1.60e+01 0s 2 3.41747702e+02 -1.41788547e+04 2.71e+03 1.78e-15 5.58e+00 0s 3 2.04478519e+02 -4.41580483e+03 4.49e+02 3.51e-14 1.21e+00 0s 4 1.79258251e+02 -2.30513481e+03 5.24e+01 2.11e-14 4.69e-01 0s 5 1.74986703e+02 -6.65124134e+02 1.15e-01 6.66e-15 1.45e-01 0s 6 1.36809514e+02 -6.86487623e+02 7.06e-02 6.77e-15 1.42e-01 0s 7 1.63360981e+02 -4.59732240e+02 6.46e-02 4.88e-15 1.08e-01 0s 8 1.01230867e+02 -2.85038054e+02 3.53e-02 2.89e-15 6.68e-02 0s 9 7.16871924e+01 -1.74600456e+02 2.27e-02 1.67e-15 4.26e-02 0s 10 5.39530918e+01 -1.65984617e+02 1.53e-02 1.78e-15 3.80e-02 0s 11 4.13130167e+01 -8.96023745e+01 1.07e-02 7.77e-16 2.26e-02 0s 12 3.01525462e+01 -5.14197648e+01 5.65e-03 5.55e-16 1.41e-02 0s 13 2.51837539e+01 -2.18798248e+01 3.00e-03 3.33e-16 8.13e-03 0s 14 2.54593542e+01 5.87064527e+00 2.04e-03 2.45e-16 3.38e-03 0s 15 2.36723869e+01 1.79776280e+01 9.19e-04 3.33e-16 9.84e-04 0s 16 2.21530361e+01 2.19038938e+01 2.36e-13 2.62e-16 4.30e-05 0s 17 2.21250358e+01 2.21247669e+01 4.00e-13 3.33e-16 4.64e-08 0s 18 2.21250000e+01 2.21250000e+01 4.08e-13 2.38e-16 4.65e-14 0s Barrier solved model in 18 iterations and 0.04 seconds Optimal objective 2.21250000e+01 Root relaxation: objective 2.212500e+01, 1866 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.12500 0 41 115.00000 22.12500 80.8% - 0s H 0 0 23.0000000 22.12500 3.80% - 0s Explored 0 nodes (3584 simplex iterations) in 0.32 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.12 seconds Gurobi run time: 0.32 seconds Total run time: 0.44 seconds Objective: 23 Solution: 1 x [1, 4, 7, 10, 13, 13, 15, 17] 1 x [1, 4, 10, 13, 13, 15, 17] 3 x [3, 6, 6, 11, 11, 14, 15, 15] 1 x [3, 5, 7, 7, 9, 9, 15] 2 x [3, 3, 5, 7, 7, 9, 9, 15] 1 x [1, 5, 6, 6, 9, 11, 15, 17] 4 x [1, 5, 6, 6, 8, 9, 15, 17] 4 x [2, 6, 6, 6, 13, 13, 15, 16] 3 x [6, 12, 13, 15, 15, 16, 16, 16] 1 x [1, 1, 6, 10, 10] 1 x [6, 12, 15, 15, 15, 15, 15, 15] 1 x [1, 1, 6, 6, 14, 15]