Build (method = -2) #dp: 6646 Step-3' Graph: 388 vertices and 1547 arcs (0.03s) Step-4' Graph: 306 vertices and 1383 arcs (0.04s) #V4/#V3 = 0.79 #A4/#A3 = 0.89 Ready! (0.04s) Optimize a model with 316 rows, 1384 columns and 3552 nonzeros Presolve removed 82 rows and 160 columns Presolve time: 0.02s Presolved: 234 rows, 1224 columns, 3327 nonzeros Variable types: 0 continuous, 1224 integer (0 binary) Found heuristic solution: objective 768.0000000 Optimize a model with 234 rows, 1224 columns and 3327 nonzeros Presolved: 234 rows, 1224 columns, 3327 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.913e+03 Factor NZ : 7.119e+03 Factor Ops : 2.792e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.77792892e+03 -1.63805281e+05 1.64e+05 2.22e-16 5.16e+02 0s 1 2.32755887e+03 -8.25122360e+04 2.37e+04 7.77e-16 9.00e+01 0s 2 1.40015976e+03 -3.14493168e+04 6.09e+03 6.66e-16 2.47e+01 0s 3 1.05995995e+03 -8.26331546e+03 8.86e+02 4.88e-15 5.04e+00 0s 4 9.91472237e+02 -1.35980086e+03 3.17e+00 8.88e-15 9.59e-01 0s 5 7.59261487e+02 -1.53962278e+03 1.88e+00 8.55e-15 9.37e-01 0s 6 6.95912259e+02 -8.88044541e+02 1.36e+00 5.77e-15 6.45e-01 0s 7 6.23380267e+02 -8.74549146e+02 1.20e+00 5.33e-15 6.10e-01 0s 8 3.92931095e+02 -3.19902825e+02 7.21e-01 2.11e-15 2.90e-01 0s 9 2.56868394e+02 -9.38368007e+01 4.24e-01 1.22e-15 1.43e-01 0s 10 2.36075824e+02 1.49497705e+01 3.36e-01 9.12e-16 9.01e-02 0s 11 1.74112835e+02 4.29812319e+01 1.85e-01 1.35e-15 5.34e-02 0s 12 1.43737649e+02 6.77317002e+01 9.90e-02 9.93e-16 3.10e-02 0s 13 1.37386052e+02 9.01333087e+01 7.27e-02 1.27e-15 1.92e-02 0s 14 1.32694251e+02 1.09568036e+02 4.41e-02 1.05e-15 9.41e-03 0s 15 1.25853059e+02 1.16052051e+02 1.62e-02 1.03e-15 3.99e-03 0s 16 1.22524512e+02 1.18268373e+02 2.84e-03 1.11e-15 1.73e-03 0s 17 1.21560565e+02 1.20070987e+02 5.62e-04 9.88e-16 6.06e-04 0s 18 1.21333524e+02 1.20564039e+02 2.80e-04 1.12e-15 3.13e-04 0s 19 1.21208749e+02 1.20768677e+02 1.73e-04 1.22e-15 1.79e-04 0s 20 1.21093455e+02 1.20906477e+02 7.26e-05 1.32e-15 7.61e-05 0s 21 1.21029572e+02 1.20967307e+02 2.12e-05 9.72e-16 2.53e-05 0s 22 1.21003304e+02 1.20997093e+02 1.41e-06 1.14e-15 2.53e-06 0s 23 1.21001002e+02 1.21000996e+02 3.22e-12 1.26e-15 2.64e-09 0s 24 1.21001000e+02 1.21001000e+02 1.09e-12 8.67e-16 2.64e-12 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.21001000e+02 Root relaxation: objective 1.210010e+02, 166 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 121.00100 0 46 768.00000 121.00100 84.2% - 0s H 0 0 122.0000000 121.00100 0.82% - 0s Explored 0 nodes (310 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.220000000000e+02, best bound 1.220000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.08 seconds Total run time: 0.13 seconds Objective: 122 Solution: 2 x [2, 2, 3, 3, 4, 6] 2 x [2, 2, 3, 3, 4, 6, 10, 10] 21 x [1, 2, 2, 4, 8, 8, 8, 9, 9] 1 x [2, 2, 3, 3, 5, 7, 9] 8 x [2, 2, 3, 3, 5, 5, 7, 9] 14 x [1, 2, 2, 2, 3, 7, 10, 10] 1 x [2, 2, 2, 3, 7, 10, 10] 9 x [4, 6, 6, 7, 7, 7, 7] 1 x [3, 3, 4, 4, 7, 8] 36 x [4, 4, 4, 4, 6, 7, 10, 10] 1 x [3, 3, 6, 6, 6, 7, 7] 21 x [7, 7, 7, 7, 7, 9, 9, 10, 10] 2 x [6, 6, 6, 6, 6, 6, 6] 1 x [6, 6, 6, 6, 6, 6, 6, 9] 2 x [6, 6, 6, 6, 6, 6, 6, 9, 9]