Build (method = -2) #dp: 5496 Step-3' Graph: 412 vertices and 1678 arcs (0.03s) Step-4' Graph: 323 vertices and 1500 arcs (0.03s) #V4/#V3 = 0.78 #A4/#A3 = 0.89 Ready! (0.03s) Optimize a model with 333 rows, 1501 columns and 3869 nonzeros Presolve removed 59 rows and 112 columns Presolve time: 0.02s Presolved: 274 rows, 1389 columns, 3741 nonzeros Variable types: 0 continuous, 1389 integer (0 binary) Found heuristic solution: objective 859.0000000 Optimize a model with 274 rows, 1389 columns and 3741 nonzeros Presolved: 274 rows, 1389 columns, 3741 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.113e+03 Factor NZ : 7.697e+03 Factor Ops : 2.836e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.71228618e+03 -2.14593763e+05 1.69e+05 2.22e-16 4.98e+02 0s 1 2.15517679e+03 -1.14398971e+05 2.67e+04 2.00e-15 9.85e+01 0s 2 1.44513791e+03 -4.35626689e+04 8.18e+03 1.17e-15 3.00e+01 0s 3 1.08514946e+03 -1.05058707e+04 1.59e+03 7.33e-15 6.29e+00 0s 4 9.90780076e+02 -1.50283105e+03 3.99e+01 1.11e-15 9.24e-01 0s 5 7.35088360e+02 -9.82733358e+02 2.39e-12 1.17e-15 6.16e-01 0s 6 5.11598618e+02 -4.52161094e+02 1.68e-12 9.11e-16 3.46e-01 0s 7 3.30504971e+02 -2.10196278e+02 1.29e-12 1.18e-15 1.94e-01 0s 8 1.98686747e+02 -4.97831846e+01 8.42e-13 1.24e-15 8.91e-02 0s 9 1.69277891e+02 2.77684542e+01 5.45e-12 9.42e-16 5.08e-02 0s 10 1.49119656e+02 5.94397022e+01 3.16e-12 1.12e-15 3.22e-02 0s 11 1.48724234e+02 7.82964961e+01 2.84e-12 1.30e-15 2.53e-02 0s 12 1.32990749e+02 1.03379697e+02 9.29e-13 1.44e-15 1.06e-02 0s 13 1.27835673e+02 1.12556596e+02 2.91e-13 1.19e-15 5.48e-03 0s 14 1.24970269e+02 1.19685826e+02 2.96e-13 9.59e-16 1.90e-03 0s 15 1.23397729e+02 1.22032850e+02 1.61e-13 9.05e-16 4.90e-04 0s 16 1.22990951e+02 1.22625055e+02 6.65e-13 9.99e-16 1.31e-04 0s 17 1.22878353e+02 1.22786783e+02 2.17e-12 1.06e-15 3.28e-05 0s 18 1.22846239e+02 1.22837104e+02 1.98e-12 8.52e-16 3.28e-06 0s 19 1.22843003e+02 1.22842994e+02 4.29e-13 8.88e-16 3.06e-09 0s 20 1.22843000e+02 1.22843000e+02 4.04e-13 1.14e-15 3.12e-15 0s Barrier solved model in 20 iterations and 0.02 seconds Optimal objective 1.22843000e+02 Root relaxation: objective 1.228430e+02, 219 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 122.84300 0 46 859.00000 122.84300 85.7% - 0s H 0 0 124.0000000 122.84300 0.93% - 0s H 0 0 123.0000000 122.84300 0.13% - 0s Explored 0 nodes (404 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.230000000000e+02, best bound 1.230000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.11 seconds Total run time: 0.15 seconds Objective: 123 Solution: 1 x [2, 3, 3, 5, 8, 9, 10] 23 x [6, 6, 6, 7, 7, 7, 8, 9] 15 x [1, 1, 1, 1, 6, 6, 8, 9, 9] 13 x [1, 4, 5, 5, 5, 5, 6, 8, 10] 11 x [3, 4, 5, 8, 8, 9, 10, 10] 22 x [2, 3, 3, 3, 4, 5, 8, 8] 3 x [2, 4, 4, 5, 5, 8, 8] 2 x [2, 3, 3, 3, 3, 3, 3, 8, 8] 2 x [4, 4, 5, 6, 8, 8, 10, 10] 5 x [2, 5, 5, 6, 6, 9, 10, 10] 2 x [1, 1, 1, 2, 4, 7, 9, 9, 9] 12 x [2, 4, 7, 7, 7, 9, 9, 9] 10 x [4, 4, 4, 5, 9, 9, 9] 2 x [2, 2, 4, 5, 6, 6, 6]