Build (method = -2) #dp: 48522 Step-3' Graph: 959 vertices and 5997 arcs (0.33s) Step-4' Graph: 865 vertices and 5810 arcs (0.33s) #V4/#V3 = 0.90 #A4/#A3 = 0.97 Ready! (0.33s) Optimize a model with 884 rows, 5811 columns and 15711 nonzeros Presolve removed 111 rows and 224 columns Presolve time: 0.06s Presolved: 773 rows, 5587 columns, 15499 nonzeros Variable types: 0 continuous, 5587 integer (0 binary) Found heuristic solution: objective 194.0000000 Optimize a model with 773 rows, 5587 columns and 15499 nonzeros Presolved: 773 rows, 5587 columns, 15499 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 9.689e+03 Factor NZ : 5.533e+04 (roughly 3 MBytes of memory) Factor Ops : 6.261e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.70331643e+03 -1.87741240e+05 1.21e+05 1.11e-16 1.26e+02 0s 1 7.96417342e+02 -7.96845490e+04 2.11e+04 4.77e-15 2.45e+01 0s 2 4.71658177e+02 -3.22038403e+04 7.15e+03 3.22e-15 8.04e+00 0s 3 4.44419582e+02 -1.21982885e+04 2.04e+03 2.31e-14 2.36e+00 0s 4 3.93345276e+02 -5.87800968e+03 5.56e+02 2.09e-14 8.52e-01 0s 5 3.58565749e+02 -2.61664320e+03 9.34e+01 3.91e-15 3.03e-01 0s 6 3.23484766e+02 -1.45896987e+03 5.05e+01 3.59e-15 1.73e-01 0s 7 2.74749632e+02 -8.44300070e+02 2.70e+01 3.03e-15 1.06e-01 0s 8 2.51965975e+02 -6.70648649e+02 2.27e+01 3.34e-15 8.68e-02 0s 9 2.05138630e+02 -5.77392109e+02 1.42e+01 3.60e-15 7.25e-02 0s 10 1.67973432e+02 -4.59836762e+02 6.22e+00 3.84e-15 5.71e-02 0s 11 1.29220779e+02 -2.61309267e+02 4.29e+00 3.74e-15 3.55e-02 0s 12 9.88803831e+01 -1.53012489e+02 3.23e+00 3.13e-15 2.30e-02 0s 13 5.63203454e+01 -4.86147144e+01 1.65e+00 2.28e-15 9.59e-03 0s 14 3.62039489e+01 -3.29987537e+01 8.24e-01 2.49e-15 6.28e-03 0s 15 3.38790204e+01 -1.68854265e+01 7.16e-01 3.21e-15 4.62e-03 0s 16 3.00729774e+01 -8.59423020e+00 5.69e-01 3.36e-15 3.51e-03 0s 17 2.75505265e+01 -1.83521409e+00 4.19e-01 3.90e-15 2.66e-03 0s 18 2.61361462e+01 9.62300585e+00 2.99e-01 3.15e-15 1.50e-03 0s 19 2.33493281e+01 1.75967826e+01 1.04e-01 2.08e-15 5.20e-04 0s 20 2.32765418e+01 2.10940447e+01 8.32e-02 1.92e-15 1.99e-04 0s 21 2.23380055e+01 2.19326502e+01 7.36e-03 2.31e-15 3.65e-05 0s 22 2.22225665e+01 2.22179870e+01 1.36e-07 1.75e-15 4.09e-07 0s 23 2.22222226e+01 2.22222180e+01 1.77e-13 2.43e-15 4.09e-10 0s 24 2.22222222e+01 2.22222222e+01 2.10e-13 2.30e-15 4.09e-13 0s Barrier solved model in 24 iterations and 0.19 seconds Optimal objective 2.22222222e+01 Root relaxation: objective 2.222222e+01, 3493 iterations, 0.24 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.22222 0 62 194.00000 22.22222 88.5% - 1s H 0 0 24.0000000 22.22222 7.41% - 1s H 0 0 23.0000000 22.22222 3.38% - 1s Explored 0 nodes (10044 simplex iterations) in 1.33 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.36 seconds Gurobi run time: 1.33 seconds Total run time: 1.69 seconds Objective: 23 Solution: 1 x [1, 4, 5, 7, 10, 12, 14, 17, 19] 2 x [1, 1, 6, 12, 12, 17, 18, 18, 19] 1 x [1, 4, 5, 7, 11, 14, 19] 5 x [6, 6, 7, 12, 12, 17, 18, 19, 19] 1 x [2, 2, 4, 5, 6, 13, 16, 17] 1 x [2, 2, 2, 2, 4, 5, 6, 13, 17] 1 x [2, 2, 2, 2, 4, 5, 6, 10, 17] 4 x [1, 4, 4, 5, 7, 10, 11, 14, 17] 1 x [5, 8, 8, 8, 8, 8, 8, 16, 17] 1 x [3, 5, 15, 15, 15, 15, 17] 2 x [3, 5, 15, 15, 15, 15, 15, 15, 17] 1 x [1, 1, 3, 3, 3, 7, 11, 17, 18] 1 x [2, 2, 4, 4, 5, 6, 9, 9, 10] 1 x [2, 2, 2, 8, 8, 10, 18]