Build (method = -2) #dp: 3872 Step-3' Graph: 412 vertices and 1603 arcs (0.02s) Step-4' Graph: 315 vertices and 1409 arcs (0.02s) #V4/#V3 = 0.76 #A4/#A3 = 0.88 Ready! (0.02s) Optimize a model with 325 rows, 1410 columns and 3612 nonzeros Presolve removed 59 rows and 108 columns Presolve time: 0.02s Presolved: 266 rows, 1302 columns, 3484 nonzeros Variable types: 0 continuous, 1302 integer (13 binary) Found heuristic solution: objective 100.0000000 Optimize a model with 266 rows, 1302 columns and 3484 nonzeros Presolved: 266 rows, 1302 columns, 3484 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.989e+03 Factor NZ : 7.189e+03 Factor Ops : 2.341e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.43827351e+03 -3.09779047e+04 3.47e+04 1.07e-01 1.10e+02 0s 1 4.05335642e+02 -1.69776289e+04 5.29e+03 1.52e-14 1.94e+01 0s 2 2.20229819e+02 -7.03907348e+03 1.42e+03 1.02e-14 5.52e+00 0s 3 1.11203542e+02 -1.61690480e+03 1.88e+02 2.71e-14 9.69e-01 0s 4 1.00460336e+02 -3.30222493e+02 3.43e+01 1.07e-14 2.02e-01 0s 5 9.70661972e+01 -1.01921249e+02 3.78e-02 8.06e-15 7.62e-02 0s 6 6.65588912e+01 -8.33932065e+01 5.58e-04 1.05e-14 5.74e-02 0s 7 3.73669932e+01 -4.21891647e+01 2.90e-04 8.65e-15 3.04e-02 0s 8 2.21972731e+01 -1.39536748e+01 1.43e-04 8.23e-15 1.38e-02 0s 9 1.62161559e+01 -4.98590652e+00 8.47e-05 9.39e-15 8.11e-03 0s 10 1.64436928e+01 9.98894422e-01 4.59e-05 1.11e-14 5.91e-03 0s 11 1.52436943e+01 6.35499082e+00 3.01e-05 1.02e-14 3.40e-03 0s 12 1.35170402e+01 9.50112961e+00 1.16e-05 8.93e-15 1.54e-03 0s 13 1.27397680e+01 1.06855630e+01 4.89e-06 9.10e-15 7.86e-04 0s 14 1.25092550e+01 1.12387874e+01 3.41e-06 9.63e-15 4.86e-04 0s 15 1.23438915e+01 1.13677490e+01 2.46e-06 1.29e-14 3.74e-04 0s 16 1.21658038e+01 1.16748782e+01 1.09e-06 1.13e-14 1.88e-04 0s 17 1.20987778e+01 1.18340667e+01 7.09e-07 8.75e-15 1.01e-04 0s 18 1.20159368e+01 1.18979866e+01 2.34e-07 8.55e-15 4.51e-05 0s 19 1.19952327e+01 1.19380536e+01 1.25e-07 9.76e-15 2.19e-05 0s 20 1.19818545e+01 1.19514731e+01 6.42e-08 8.89e-15 1.16e-05 0s 21 1.19720067e+01 1.19629896e+01 1.95e-08 8.07e-15 3.45e-06 0s 22 1.19676932e+01 1.19664936e+01 2.48e-09 8.79e-15 4.59e-07 0s 23 1.19670008e+01 1.19669992e+01 4.09e-13 6.83e-15 6.19e-10 0s 24 1.19670000e+01 1.19670000e+01 7.07e-14 6.66e-15 6.19e-13 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.19670000e+01 Root relaxation: objective 1.196700e+01, 181 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.96700 0 45 100.00000 11.96700 88.0% - 0s H 0 0 14.0000000 11.96700 14.5% - 0s H 0 0 13.0000000 11.96700 7.95% - 0s 0 0 11.96700 0 40 13.00000 11.96700 7.95% - 0s 0 0 11.96700 0 45 13.00000 11.96700 7.95% - 0s 0 0 11.96875 0 56 13.00000 11.96875 7.93% - 0s 0 0 11.96875 0 61 13.00000 11.96875 7.93% - 0s 0 0 11.96875 0 61 13.00000 11.96875 7.93% - 0s 0 0 11.96875 0 72 13.00000 11.96875 7.93% - 0s 0 0 11.96875 0 43 13.00000 11.96875 7.93% - 0s H 0 0 12.0000000 11.96875 0.26% - 0s Cutting planes: Gomory: 1 MIR: 1 Explored 0 nodes (993 simplex iterations) in 0.31 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.31 seconds Total run time: 0.34 seconds Objective: 12 Solution: 1 x [3, 3, 5, 7, 8, 8, 9, 10] 1 x [3, 5, 7, 7, 9, 9, 10] 2 x [2, 2, 4, 4, 5, 6, 10, 10, 10] 1 x [2, 2, 2, 4, 4, 5, 5, 6, 8] 1 x [1, 2, 2, 4, 5, 9, 10, 10, 10] 1 x [3, 3, 3, 4, 5, 5, 9, 9, 10] 1 x [2, 4, 5, 5, 5, 5, 5, 10] 3 x [2, 2, 2, 8, 9, 9, 10, 10] 1 x [2, 2, 2, 8, 9, 9, 9, 9]