Build (method = -2) #dp: 10312 Step-3' Graph: 1226 vertices and 3671 arcs (0.07s) Step-4' Graph: 966 vertices and 3151 arcs (0.08s) #V4/#V3 = 0.79 #A4/#A3 = 0.86 Ready! (0.08s) Optimize a model with 986 rows, 3152 columns and 7528 nonzeros Presolve removed 277 rows and 546 columns Presolve time: 0.05s Presolved: 709 rows, 2606 columns, 7114 nonzeros Variable types: 0 continuous, 2606 integer (0 binary) Optimize a model with 709 rows, 2606 columns and 7114 nonzeros Presolved: 709 rows, 2606 columns, 7114 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.857e+03 Factor NZ : 3.720e+04 (roughly 2 MBytes of memory) Factor Ops : 3.944e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.75394710e+03 -2.30648377e+05 5.13e+05 5.88e-03 4.79e+02 0s 1 1.38103455e+03 -1.48929664e+05 7.31e+04 4.00e-02 8.64e+01 0s 2 7.18612632e+02 -5.00321027e+04 1.51e+04 1.55e-15 1.97e+01 0s 3 4.96073668e+02 -9.87087123e+03 2.07e+03 8.88e-16 3.19e+00 0s 4 3.01973233e+02 -1.85642923e+03 2.87e+02 9.44e-16 5.56e-01 0s 5 2.75558129e+02 -5.71594647e+02 1.03e+02 8.71e-16 1.97e-01 0s 6 2.61073537e+02 -1.09078811e+02 4.37e+01 4.44e-16 7.97e-02 0s 7 2.42894722e+02 1.29003079e+01 7.61e+00 3.49e-16 4.54e-02 0s 8 2.20501505e+02 1.04507287e+02 1.97e+00 4.46e-16 2.25e-02 0s 9 2.12008970e+02 1.55504029e+02 1.12e+00 3.34e-16 1.10e-02 0s 10 2.10007623e+02 1.91291289e+02 5.46e-01 2.87e-16 3.64e-03 0s 11 2.07055151e+02 2.06162054e+02 8.51e-04 4.22e-16 1.72e-04 0s 12 2.07000057e+02 2.06999163e+02 1.87e-11 3.89e-16 1.72e-07 0s 13 2.07000000e+02 2.06999999e+02 4.07e-11 2.75e-16 1.72e-10 0s Barrier solved model in 13 iterations and 0.08 seconds Optimal objective 2.07000000e+02 Root relaxation: objective 2.070000e+02, 1788 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 207.0000000 207.00000 0.0% - 0s Explored 0 nodes (2250 simplex iterations) in 0.36 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.070000000000e+02, best bound 2.070000000000e+02, gap 0.0% Preprocessing time: 0.10 seconds Gurobi run time: 0.36 seconds Total run time: 0.45 seconds Objective: 207 Solution: 21 x [1, 3, 4, 5, 9, 10, 20] 26 x [1, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20] 25 x [1, 4, 5, 7, 9, 10, 11, 13, 15] 9 x [1, 4, 5, 7, 9, 10, 11, 13, 15, 18] 9 x [1, 4, 5, 7, 9, 10, 11, 13, 15, 18, 19] 3 x [2, 3, 4, 5, 7, 9, 10, 13, 20] 22 x [2, 3, 5, 6, 7, 9, 10, 13] 2 x [2, 4, 5, 7, 8, 10, 11, 14, 15, 16, 17, 18, 19] 9 x [2, 4, 5, 7, 8, 10, 11, 15, 16, 17, 18, 19] 10 x [2, 4, 5, 7, 8, 10, 11, 15, 16, 18, 19] 23 x [2, 4, 5, 7, 9, 10, 11, 12, 13, 14, 15, 17] 4 x [2, 4, 5, 7, 9, 10, 13, 20] 1 x [2, 4, 5, 7, 10, 13, 20] 1 x [2, 5] 1 x [2, 5, 7] 1 x [2, 5, 7, 10, 13, 20] 12 x [3, 4, 5, 7, 9, 10, 11, 13, 15, 20] 6 x [3, 4, 5, 7, 9, 10, 13, 15, 16] 4 x [3, 4, 5, 7, 9, 10, 13, 15, 20] 8 x [3, 4, 5, 7, 9, 10, 13, 16] 5 x [5, 7] 1 x [5, 7, 10, 13, 16] 3 x [5, 7, 13] 1 x [5, 7, 13, 16]