Build (method = -2) #dp: 31503 Step-3' Graph: 495 vertices and 4423 arcs (0.22s) Step-4' Graph: 398 vertices and 4229 arcs (0.22s) #V4/#V3 = 0.80 #A4/#A3 = 0.96 Ready! (0.22s) Optimize a model with 444 rows, 4230 columns and 11898 nonzeros Presolve removed 50 rows and 57 columns Presolve time: 0.08s Presolved: 394 rows, 4173 columns, 11992 nonzeros Variable types: 0 continuous, 4173 integer (3165 binary) Optimize a model with 394 rows, 4173 columns and 11992 nonzeros Presolved: 394 rows, 4173 columns, 11992 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.090e+03 Factor NZ : 2.739e+04 (roughly 2 MBytes of memory) Factor Ops : 2.686e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.72637656e+03 -2.86873350e+04 1.26e+05 1.22e-01 5.40e+01 0s 1 2.50557882e+03 -9.54551507e+03 1.99e+04 2.49e-02 9.10e+00 0s 2 4.46787584e+02 -2.71695140e+03 2.60e+03 1.08e-03 1.33e+00 0s 3 1.24680173e+02 -8.77614988e+02 4.43e+02 7.22e-16 2.75e-01 0s 4 5.20583642e+01 -1.53555510e+02 8.25e+01 5.55e-16 5.15e-02 0s 5 2.65092431e+01 -4.61078725e+01 2.78e+01 9.99e-16 1.70e-02 0s 6 1.98922018e+01 -1.78504048e+01 1.62e+01 7.88e-16 8.79e-03 0s 7 1.36498675e+01 -6.58972172e+00 5.04e+00 9.99e-16 3.53e-03 0s 8 1.28524050e+01 1.01613552e+00 4.02e+00 7.77e-16 2.05e-03 0s 9 1.16142518e+01 5.22995764e+00 2.24e+00 6.66e-16 1.02e-03 0s 10 1.08295708e+01 8.26529933e+00 1.18e+00 5.10e-16 3.84e-04 0s 11 1.01182086e+01 9.57042594e+00 1.13e-01 6.66e-16 7.07e-05 0s 12 1.00016267e+01 9.99343277e+00 1.25e-03 4.56e-16 1.03e-06 0s 13 1.00000000e+01 9.99999997e+00 6.37e-09 9.99e-16 4.56e-12 0s Barrier solved model in 13 iterations and 0.07 seconds Optimal objective 1.00000000e+01 Root relaxation: objective 1.000000e+01, 2782 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.00000 0 21 - 10.00000 - - 0s H 0 0 13.0000000 10.00000 23.1% - 0s H 0 0 11.0000000 10.00000 9.09% - 0s 0 0 10.00000 0 25 11.00000 10.00000 9.09% - 1s * 0 0 0 10.0000000 10.00000 0.0% - 1s Explored 0 nodes (11639 simplex iterations) in 1.56 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.24 seconds Gurobi run time: 1.56 seconds Total run time: 1.80 seconds Objective: 10 Solution: 1 x [20, 23, 25, 37, 44] 1 x [8, 10, 31, 32, 40] 1 x [1, 7, 18, 20, 38] 1 x [11, 14, 24, 30, 36] 1 x [9, 15, 22, 41, 45] 1 x [6, 12, 13, 16, 35] 1 x [2, 26, 27, 30, 46] 1 x [4, 8, 28, 39, 42] 1 x [3, 5, 17, 33, 43] 1 x [18, 19, 21, 29, 34]