Build (method = -2) #dp: 21588 Step-3' Graph: 414 vertices and 2251 arcs (0.12s) Step-4' Graph: 326 vertices and 2075 arcs (0.12s) #V4/#V3 = 0.79 #A4/#A3 = 0.92 Ready! (0.12s) Optimize a model with 346 rows, 2076 columns and 5586 nonzeros Presolve removed 47 rows and 95 columns Presolve time: 0.03s Presolved: 299 rows, 1981 columns, 5490 nonzeros Variable types: 0 continuous, 1981 integer (129 binary) Found heuristic solution: objective 170.0000000 Optimize a model with 299 rows, 1981 columns and 5490 nonzeros Presolved: 299 rows, 1981 columns, 5490 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.174e+03 Factor NZ : 1.091e+04 (roughly 1 MByte of memory) Factor Ops : 5.083e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.06473839e+03 -5.14756790e+04 5.63e+04 1.68e-01 1.19e+02 0s 1 7.70767930e+02 -2.38890467e+04 8.66e+03 6.66e-16 2.09e+01 0s 2 3.84042531e+02 -9.24336842e+03 2.28e+03 6.66e-16 5.73e+00 0s 3 2.38511719e+02 -2.59326709e+03 3.57e+02 4.66e-15 1.12e+00 0s 4 2.02244337e+02 -5.13389761e+02 4.25e+01 7.55e-15 2.10e-01 0s 5 1.92742406e+02 -2.85879663e+02 1.22e+01 5.33e-15 1.27e-01 0s 6 1.68544973e+02 -2.92264869e+02 9.71e+00 4.88e-15 1.21e-01 0s 7 1.24308828e+02 -1.55329704e+02 5.23e+00 3.00e-15 7.26e-02 0s 8 1.09159851e+02 -1.42823058e+02 4.49e+00 2.78e-15 6.53e-02 0s 9 5.89856536e+01 -6.27471097e+01 1.93e+00 1.33e-15 3.13e-02 0s 10 4.04610641e+01 -1.99079122e+01 9.24e-01 8.88e-16 1.55e-02 0s 11 3.30886174e+01 -4.48968522e+00 5.50e-01 5.55e-16 9.59e-03 0s 12 3.13349011e+01 1.18679009e+01 4.02e-01 3.33e-16 4.97e-03 0s 13 3.04354759e+01 2.09818264e+01 1.93e-01 2.94e-16 2.40e-03 0s 14 2.87366030e+01 2.77582449e+01 3.22e-03 2.93e-16 2.46e-04 0s 15 2.85719894e+01 2.85667334e+01 3.87e-13 3.33e-16 1.32e-06 0s 16 2.85714291e+01 2.85714239e+01 3.59e-13 2.82e-16 1.32e-09 0s 17 2.85714286e+01 2.85714286e+01 2.93e-13 3.33e-16 1.32e-12 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 1356 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 59 170.00000 28.57143 83.2% - 0s H 0 0 30.0000000 28.57143 4.76% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1749 simplex iterations) in 0.17 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.14 seconds Gurobi run time: 0.17 seconds Total run time: 0.31 seconds Objective: 29 Solution: 1 x [1, 3, 9, 9, 14, 17, 19] 4 x [1, 1, 5, 10, 11, 14, 20] 7 x [3, 3, 7, 8, 9, 12, 14] 4 x [5, 7, 15, 16, 18, 18, 20] 2 x [2, 16, 16, 16, 17, 18, 20] 1 x [4, 8, 10, 16, 16, 16, 20] 1 x [2, 6, 7, 15, 18, 19, 20] 2 x [2, 7, 11, 13, 19, 19, 20] 2 x [7, 11, 11, 15, 15, 15, 20] 1 x [2, 11, 12, 20] 2 x [1, 1, 12, 12, 13, 17, 20] 2 x [1, 1, 2, 8, 9, 17, 20]