Build (method = -2) #dp: 19870 Step-3' Graph: 994 vertices and 4024 arcs (0.12s) Step-4' Graph: 927 vertices and 3890 arcs (0.12s) #V4/#V3 = 0.93 #A4/#A3 = 0.97 Ready! (0.12s) Optimize a model with 936 rows, 3891 columns and 9836 nonzeros Presolve removed 319 rows and 620 columns Presolve time: 0.06s Presolved: 617 rows, 3271 columns, 8862 nonzeros Variable types: 0 continuous, 3271 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 617 rows, 3271 columns and 8862 nonzeros Presolved: 617 rows, 3271 columns, 8862 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.910e+03 Factor NZ : 3.112e+04 (roughly 2 MBytes of memory) Factor Ops : 2.694e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.69069119e+03 -5.58123413e+05 5.54e+05 2.22e-16 7.59e+02 0s 1 2.25018392e+03 -3.65513547e+05 7.67e+04 7.77e-16 1.41e+02 0s 2 1.48089589e+03 -1.57227455e+05 2.38e+04 6.66e-16 4.57e+01 0s 3 1.11523037e+03 -5.86882308e+04 6.32e+03 4.44e-15 1.41e+01 0s 4 1.02254900e+03 -1.78042617e+04 1.28e+03 1.64e-14 3.73e+00 0s 5 9.92088386e+02 -4.29940607e+03 1.60e+00 6.00e-15 8.09e-01 0s 6 9.56908382e+02 -2.01691139e+03 4.28e-12 3.22e-15 4.54e-01 0s 7 7.02735549e+02 -1.05500573e+03 2.85e-12 1.67e-15 2.68e-01 0s 8 4.57141343e+02 -9.42930940e+02 2.53e-12 1.33e-15 2.14e-01 0s 9 3.13878871e+02 -3.79376236e+02 1.58e-12 7.77e-16 1.06e-01 0s 10 2.35483140e+02 -1.66714882e+02 9.38e-13 3.39e-16 6.14e-02 0s 11 1.37038230e+02 -6.09745181e+01 9.16e-13 4.45e-16 3.02e-02 0s 12 1.07605692e+02 -2.40635611e+01 5.47e-13 5.24e-16 2.01e-02 0s 13 8.74929214e+01 -5.11535510e-01 7.28e-13 4.97e-16 1.34e-02 0s 14 8.95598980e+01 4.21006266e+01 4.10e-13 3.46e-16 7.24e-03 0s 15 8.21770238e+01 5.84786658e+01 3.48e-12 3.67e-16 3.62e-03 0s 16 7.26617502e+01 6.67013363e+01 3.94e-12 3.68e-16 9.10e-04 0s 17 7.14690386e+01 7.09575594e+01 5.36e-12 4.35e-16 7.81e-05 0s 18 7.14286619e+01 7.14280610e+01 6.12e-12 3.33e-16 9.17e-08 0s 19 7.14285714e+01 7.14285714e+01 1.08e-11 3.33e-16 9.19e-14 0s Barrier solved model in 19 iterations and 0.09 seconds Optimal objective 7.14285714e+01 Root relaxation: objective 7.142857e+01, 1756 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 71.42857 0 45 1000.00000 71.42857 92.9% - 0s H 0 0 73.0000000 71.42857 2.15% - 0s H 0 0 72.0000000 71.42857 0.79% - 0s Explored 0 nodes (3861 simplex iterations) in 0.42 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.200000000000e+01, best bound 7.200000000000e+01, gap 0.0% Preprocessing time: 0.14 seconds Gurobi run time: 0.42 seconds Total run time: 0.57 seconds Objective: 72 Solution: 16 x [2, 3, 3, 3, 3, 4, 6, 7, 7, 7, 7, 9, 9, 9] 1 x [2, 6, 9, 9, 9, 9] 21 x [1, 2, 2, 4, 4, 4, 4, 5, 5, 6, 6, 6, 9, 9] 2 x [2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 9] 5 x [1, 2, 4, 4, 4, 4, 6, 6, 6, 6, 9, 9, 9, 9] 5 x [2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 9] 15 x [1, 1, 1, 2, 4, 4, 4, 4, 5, 5, 8, 8, 8, 8] 1 x [2, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 8, 9] 6 x [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8, 8, 8]