Build (method = -2) #dp: 864 Step-3' Graph: 52 vertices and 145 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 158 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 755.0000000 Optimize a model with 15 rows, 54 columns and 158 nonzeros Presolved: 15 rows, 54 columns, 158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.23620114e+03 -6.04434108e+03 8.60e+02 0.00e+00 2.35e+02 0s 1 7.91488360e+02 -2.36104864e+03 4.84e+01 4.44e-16 3.35e+01 0s 2 3.79439362e+02 -1.11144329e+02 6.65e-02 1.11e-15 4.19e+00 0s 3 2.16018694e+02 1.17057684e+02 3.67e-03 3.43e-16 8.39e-01 0s 4 2.02385422e+02 1.93140191e+02 5.07e-04 2.22e-16 7.83e-02 0s 5 2.00117270e+02 1.98518177e+02 3.99e-05 2.63e-16 1.36e-02 0s 6 2.00000066e+02 1.99999785e+02 2.47e-11 2.38e-16 2.38e-06 0s 7 2.00000000e+02 2.00000000e+02 7.88e-14 3.33e-16 3.10e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (45 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 2 x [1, 2, 4, 8, 8] 56 x [2, 3, 5, 8, 9] 87 x [2, 5, 5, 8, 9] 17 x [1, 2, 2, 8, 10] 32 x [2, 2, 6, 7, 8] 1 x [2, 2, 7, 8, 8] 5 x [1, 4, 5, 8, 8]