Build (method = -2) #dp: 913 Step-3' Graph: 51 vertices and 143 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 161 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 157 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 524.0000000 Optimize a model with 15 rows, 54 columns and 157 nonzeros Presolved: 15 rows, 54 columns, 157 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.46170377e+03 -6.68827370e+03 8.42e+02 1.11e-16 2.41e+02 0s 1 9.77829002e+02 -2.54594051e+03 5.56e+01 3.33e-16 3.72e+01 0s 2 4.49665132e+02 -1.26222860e+02 5.19e-01 2.22e-15 4.93e+00 0s 3 2.20671306e+02 1.28176505e+02 4.19e-02 2.22e-16 7.84e-01 0s 4 2.02439691e+02 1.95010586e+02 5.93e-03 2.22e-16 6.29e-02 0s 5 2.00291763e+02 1.99922168e+02 7.78e-04 2.22e-16 3.12e-03 0s 6 2.00000000e+02 1.99999999e+02 5.26e-10 4.44e-16 1.46e-08 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 44 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 (44 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: 8 x [3, 6, 7, 8, 10] 2 x [1, 4, 5, 7, 10] 1 x [1, 3, 6, 7, 10] 10 x [3, 5, 7, 7, 10] 87 x [2, 4, 7, 8, 9] 36 x [4, 4, 5, 6, 7] 1 x [1, 3, 5, 7, 7] 55 x [3, 6, 6, 8, 9]