Build (method = -2) #dp: 1284 Step-3' Graph: 190 vertices and 773 arcs (0.01s) Step-4' Graph: 161 vertices and 713 arcs (0.01s) #V4/#V3 = 0.85 #A4/#A3 = 0.92 Ready! (0.01s) Optimize a model with 168 rows, 714 columns and 1841 nonzeros Presolve removed 20 rows and 36 columns Presolve time: 0.01s Presolved: 148 rows, 678 columns, 1799 nonzeros Variable types: 0 continuous, 678 integer (0 binary) Found heuristic solution: objective 319.0000000 Found heuristic solution: objective 316.0000000 Optimize a model with 148 rows, 678 columns and 1799 nonzeros Presolved: 148 rows, 678 columns, 1799 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.023e+03 Factor NZ : 3.589e+03 Factor Ops : 9.897e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.31433460e+03 -2.33021067e+04 2.18e+04 1.11e-16 1.42e+02 0s 1 4.37850457e+02 -1.35527969e+04 3.09e+03 4.44e-16 2.63e+01 0s 2 2.78286524e+02 -3.29781865e+03 5.27e+02 9.99e-16 4.89e+00 0s 3 1.23354894e+02 -8.45984536e+02 7.98e+01 1.33e-15 9.48e-01 0s 4 8.36438184e+01 -1.46264258e+02 3.10e+01 5.83e-16 2.22e-01 0s 5 9.91194982e+01 -1.11050516e+02 2.08e+01 4.68e-16 1.87e-01 0s 6 6.98586470e+01 -4.39133412e+01 1.24e+01 3.26e-16 9.64e-02 0s 7 5.26335439e+01 -2.43703861e+01 7.16e+00 2.64e-16 6.30e-02 0s 8 4.00227960e+01 1.50140229e+01 2.44e+00 2.22e-16 2.02e-02 0s 9 3.62570412e+01 2.09346229e+01 1.33e+00 2.34e-16 1.22e-02 0s 10 3.53780035e+01 2.65605176e+01 1.10e+00 2.22e-16 7.12e-03 0s 11 3.28989195e+01 2.93318343e+01 2.39e-01 1.48e-16 2.73e-03 0s 12 3.25321693e+01 3.08203374e+01 7.09e-02 1.76e-16 1.28e-03 0s 13 3.19939475e+01 3.12580360e+01 1.82e-02 2.22e-16 5.46e-04 0s 14 3.19125677e+01 3.16127665e+01 8.11e-03 2.06e-16 2.23e-04 0s 15 3.18589397e+01 3.17218981e+01 2.77e-03 2.22e-16 1.01e-04 0s 16 3.18218578e+01 3.17955857e+01 2.68e-04 2.22e-16 1.94e-05 0s 17 3.18158506e+01 3.18103385e+01 3.70e-05 2.13e-16 4.06e-06 0s 18 3.18148159e+01 3.18148103e+01 1.06e-13 3.05e-16 4.13e-09 0s 19 3.18148148e+01 3.18148148e+01 6.63e-14 2.22e-16 4.18e-15 0s Barrier solved model in 19 iterations and 0.01 seconds Optimal objective 3.18148148e+01 Root relaxation: objective 3.181481e+01, 228 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 31.81481 0 24 316.00000 31.81481 89.9% - 0s H 0 0 33.0000000 31.81481 3.59% - 0s 0 0 31.83333 0 13 33.00000 31.83333 3.54% - 0s H 0 0 32.0000000 31.83333 0.52% - 0s Cutting planes: Gomory: 1 Mod-K: 1 Explored 0 nodes (406 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.200000000000e+01, best bound 3.200000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.07 seconds Total run time: 0.10 seconds Objective: 32 Solution: 2 x [2, 4, 4, 4, 4, 4, 5, 5, 7] 8 x [2, 2, 4, 4, 4, 4, 4, 4, 6] 3 x [1, 1, 4, 4, 4, 4, 6, 6, 7, 7] 1 x [3, 4, 4, 4, 6, 6, 6, 7, 7] 3 x [3, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6] 15 x [4, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6]