Build (method = -2) #dp: 3403 Step-3' Graph: 225 vertices and 763 arcs (0.02s) Step-4' Graph: 159 vertices and 631 arcs (0.02s) #V4/#V3 = 0.71 #A4/#A3 = 0.83 Ready! (0.02s) Optimize a model with 169 rows, 632 columns and 1589 nonzeros Presolve removed 30 rows and 58 columns Presolve time: 0.01s Presolved: 139 rows, 574 columns, 1493 nonzeros Variable types: 0 continuous, 574 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 800.0000000 Optimize a model with 139 rows, 574 columns and 1493 nonzeros Presolved: 139 rows, 574 columns, 1493 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.150e+02 Factor NZ : 3.174e+03 Factor Ops : 8.595e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.11757845e+03 -6.68693085e+04 5.60e+04 2.22e-16 3.07e+02 0s 1 1.55379102e+03 -3.09242660e+04 8.67e+03 5.55e-16 5.87e+01 0s 2 1.08896271e+03 -8.50823512e+03 1.84e+03 6.66e-16 1.28e+01 0s 3 8.79924461e+02 -1.31747065e+03 1.82e+01 2.22e-15 1.92e+00 0s 4 5.97226108e+02 -2.31394311e+02 8.32e+00 3.33e-16 7.24e-01 0s 5 4.41869408e+02 -1.36312285e+02 5.75e+00 4.37e-16 5.05e-01 0s 6 3.33289823e+02 -7.13536377e+01 3.94e+00 5.85e-16 3.53e-01 0s 7 2.34963040e+02 -3.02133853e+01 2.55e+00 6.89e-16 2.31e-01 0s 8 1.73730034e+02 3.14537437e+01 1.53e+00 5.55e-16 1.24e-01 0s 9 1.46111009e+02 7.22869773e+01 8.03e-01 3.47e-16 6.43e-02 0s 10 1.33638156e+02 1.04878848e+02 3.83e-01 3.33e-16 2.50e-02 0s 11 1.25794446e+02 1.23385120e+02 3.72e-04 3.31e-16 2.08e-03 0s 12 1.25001024e+02 1.24997126e+02 8.14e-13 4.44e-16 3.37e-06 0s 13 1.25000000e+02 1.25000000e+02 4.63e-12 4.18e-16 3.54e-12 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 311 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 43 800.00000 125.00000 84.4% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 11 126.00000 125.00000 0.79% - 0s 0 0 125.00000 0 33 126.00000 125.00000 0.79% - 0s * 0 0 0 125.0000000 125.00000 0.0% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (1210 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.10 seconds Total run time: 0.12 seconds Objective: 125 Solution: 17 x [1, 2, 4, 4, 4, 6, 6, 6] 3 x [1, 3, 3, 6, 7, 10, 10, 10] 9 x [1, 1, 2, 3, 4, 5, 8, 9] 28 x [1, 1, 6, 7, 9, 10, 10, 10] 2 x [1, 1, 6, 7, 7, 9, 10, 10] 2 x [2, 4, 4, 4, 6, 6, 6, 9] 13 x [2, 4, 4, 4, 5, 9, 10, 10] 1 x [2, 4, 4, 4, 9, 10, 10, 10] 27 x [2, 3, 4, 5, 5, 7, 9, 9] 18 x [5, 6, 7, 7, 7, 9, 9, 10] 5 x [3, 3, 3, 4, 4, 7, 10, 10]