Build (method = -2) #dp: 31070 Step-3' Graph: 727 vertices and 4314 arcs (0.19s) Step-4' Graph: 658 vertices and 4176 arcs (0.19s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.19s) Optimize a model with 677 rows, 4177 columns and 11226 nonzeros Presolve removed 86 rows and 156 columns Presolve time: 0.07s Presolved: 591 rows, 4021 columns, 11111 nonzeros Variable types: 0 continuous, 4021 integer (270 binary) Found heuristic solution: objective 1712.0000000 Optimize a model with 591 rows, 4021 columns and 11111 nonzeros Presolve removed 2 rows and 2 columns Presolved: 589 rows, 4019 columns, 11115 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.902e+03 Factor NZ : 3.713e+04 (roughly 2 MBytes of memory) Factor Ops : 3.813e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.07883688e+04 -1.04655274e+06 1.53e+06 4.50e-02 1.74e+03 0s 1 8.79265878e+03 -5.94762104e+05 1.81e+05 4.11e-15 2.50e+02 0s 2 4.38317632e+03 -2.49504615e+05 4.76e+04 2.16e-15 7.12e+01 0s 3 3.12630880e+03 -7.43397406e+04 1.32e+04 1.29e-14 1.89e+01 0s 4 2.68472226e+03 -2.98276788e+04 3.73e+03 5.33e-15 6.32e+00 0s 5 2.23201728e+03 -1.68521749e+04 1.97e+03 2.31e-15 3.42e+00 0s 6 2.02852022e+03 -5.06297674e+03 8.77e+02 2.52e-15 1.17e+00 0s 7 1.99178892e+03 -3.18989233e+03 5.70e+02 2.59e-15 8.00e-01 0s 8 1.80871067e+03 -2.16519016e+03 4.07e+02 2.83e-15 5.98e-01 0s 9 1.12694548e+03 -1.68250480e+03 9.80e+01 3.27e-15 3.74e-01 0s 10 8.67127207e+02 -9.11326524e+02 7.09e+01 2.60e-15 2.38e-01 0s 11 7.30484823e+02 -7.46897308e+02 5.65e+01 2.82e-15 1.97e-01 0s 12 4.94777150e+02 -3.66682880e+02 3.56e+01 2.75e-15 1.15e-01 0s 13 4.00327518e+02 -2.61657544e+02 2.62e+01 3.13e-15 8.78e-02 0s 14 3.68155742e+02 -7.67873826e+01 2.04e+01 2.66e-15 5.91e-02 0s 15 2.95856668e+02 6.98601380e+01 9.96e+00 2.36e-15 2.96e-02 0s 16 2.83998874e+02 1.70470697e+02 7.20e+00 2.13e-15 1.49e-02 0s 17 2.66165656e+02 2.09640228e+02 3.04e+00 2.42e-15 7.29e-03 0s 18 2.56680158e+02 2.38260274e+02 1.27e+00 2.04e-15 2.37e-03 0s 19 2.50101003e+02 2.48560082e+02 1.26e-02 1.77e-15 1.92e-04 0s 20 2.50000282e+02 2.49992387e+02 9.95e-07 2.03e-15 9.80e-07 0s 21 2.50000000e+02 2.49999992e+02 2.92e-11 1.72e-15 9.80e-10 0s 22 2.50000000e+02 2.50000000e+02 2.83e-11 1.76e-15 9.80e-13 0s Barrier solved model in 22 iterations and 0.13 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 2552 iterations, 0.17 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 250.00000 0 79 1712.00000 250.00000 85.4% - 0s H 0 0 251.0000000 250.00000 0.40% - 0s H 0 0 250.0000000 250.00000 0.0% - 0s Explored 0 nodes (5309 simplex iterations) in 0.71 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0% Preprocessing time: 0.21 seconds Gurobi run time: 0.71 seconds Total run time: 0.92 seconds Objective: 250 Solution: 1 x [3, 5, 11, 12, 13, 13, 16, 18] 1 x [1, 1, 3, 10, 11, 14, 16, 18] 5 x [3, 4, 5, 9, 11, 15, 15, 18] 1 x [1, 1, 10, 11, 11, 12, 16, 18] 1 x [5, 10, 10, 10, 11, 11, 12, 18] 14 x [1, 10, 11, 11, 14, 16, 17, 18] 10 x [10, 11, 11, 13, 13, 14, 16, 18] 14 x [2, 2, 3, 5, 15, 16, 18, 18] 24 x [3, 5, 5, 5, 5, 15, 18, 18] 1 x [2, 9, 11, 15, 15, 16, 18, 18] 1 x [5, 5, 9, 11, 15, 15, 18, 18] 11 x [3, 6, 6, 7, 8, 10, 12, 13] 36 x [1, 3, 7, 7, 7, 10, 12, 17] 32 x [2, 3, 4, 4, 9, 9, 12, 16] 1 x [1, 1, 3, 4, 7, 8, 8, 14] 32 x [5, 7, 9, 11, 12, 14, 15, 15] 37 x [6, 7, 8, 8, 10, 11, 12, 17] 1 x [6, 6, 6, 7, 11, 13, 13, 14] 1 x [2, 4, 7, 7, 14, 15, 15, 19] 1 x [4, 6, 6, 7, 7, 10, 10, 14] 1 x [4, 4, 7, 7, 9, 14, 15, 15] 1 x [2, 6, 7, 7, 9, 9, 14, 16] 2 x [4, 6, 6, 6, 6, 6, 10, 14] 21 x [2, 4, 4, 4, 6, 6, 14, 16]