Build (method = -2) #dp: 3836 Step-3' Graph: 328 vertices and 1330 arcs (0.02s) Step-4' Graph: 268 vertices and 1210 arcs (0.02s) #V4/#V3 = 0.82 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 278 rows, 1211 columns and 3102 nonzeros Presolve removed 71 rows and 129 columns Presolve time: 0.02s Presolved: 207 rows, 1082 columns, 2952 nonzeros Variable types: 0 continuous, 1082 integer (83 binary) Found heuristic solution: objective 97.0000000 Optimize a model with 207 rows, 1082 columns and 2952 nonzeros Presolved: 207 rows, 1082 columns, 2952 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.692e+03 Factor NZ : 6.168e+03 Factor Ops : 2.342e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.33926404e+03 -2.50227289e+04 2.62e+04 7.38e-02 1.30e+02 0s 1 3.64331720e+02 -1.46376820e+04 3.96e+03 6.66e-15 2.32e+01 0s 2 1.77207399e+02 -5.62951665e+03 7.65e+02 3.66e-15 5.31e+00 0s 3 1.20819035e+02 -1.60913782e+03 1.26e+02 4.00e-15 1.15e+00 0s 4 1.04316099e+02 -4.65849140e+02 3.92e+01 4.88e-15 3.37e-01 0s 5 9.74085908e+01 -1.35843318e+02 8.24e+00 3.83e-15 1.16e-01 0s 6 6.58572742e+01 -1.49275333e+02 3.81e+00 6.04e-15 1.03e-01 0s 7 6.33716792e+01 -8.06609803e+01 3.26e+00 6.74e-15 6.91e-02 0s 8 5.51137901e+01 -7.69931860e+01 2.73e+00 7.28e-15 6.32e-02 0s 9 3.29733609e+01 -3.09846758e+01 1.39e+00 4.02e-15 3.05e-02 0s 10 2.54504519e+01 -8.20010304e+00 7.47e-01 4.22e-15 1.60e-02 0s 11 1.89527640e+01 -1.00195409e+00 4.95e-01 4.60e-15 9.48e-03 0s 12 1.51103769e+01 2.30332031e+00 3.14e-01 4.99e-15 6.06e-03 0s 13 1.35086946e+01 5.52681418e+00 1.87e-01 5.75e-15 3.75e-03 0s 14 1.27574869e+01 9.23999698e+00 1.23e-01 4.46e-15 1.66e-03 0s 15 1.20397293e+01 1.00450498e+01 6.74e-02 4.57e-15 9.35e-04 0s 16 1.16399853e+01 1.06880999e+01 3.76e-02 4.05e-15 4.46e-04 0s 17 1.13896085e+01 1.08473182e+01 2.07e-02 4.73e-15 2.54e-04 0s 18 1.12405329e+01 1.09436227e+01 1.03e-02 4.98e-15 1.39e-04 0s 19 1.11210569e+01 1.10830483e+01 1.94e-04 4.52e-15 1.75e-05 0s 20 1.11111246e+01 1.11110721e+01 3.73e-12 3.27e-15 2.42e-08 0s 21 1.11111111e+01 1.11111111e+01 1.10e-11 3.96e-15 2.44e-14 0s Barrier solved model in 21 iterations and 0.02 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 582 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 37 97.00000 11.11111 88.5% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (1170 simplex iterations) in 0.11 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.11 seconds Total run time: 0.14 seconds Objective: 12 Solution: 1 x [4, 7, 7, 8, 9, 10] 2 x [4, 6, 7, 7, 7, 7, 7, 8, 8] 1 x [4, 4, 5, 7, 7, 7, 8, 8, 9] 1 x [2, 3, 3, 7, 7, 7, 8, 8] 1 x [2, 7, 7, 7, 8, 8] 5 x [1, 3, 3, 5, 5, 5, 6, 6, 6] 1 x [1, 2, 3, 3, 3, 3, 3, 3]