Build (method = -2) #dp: 861 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 887.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.17191543e+03 -6.04385034e+03 8.34e+02 2.22e-16 2.30e+02 0s 1 7.37017000e+02 -2.61326043e+03 2.48e+01 5.55e-16 3.22e+01 0s 2 4.14796381e+02 -5.68424478e+01 2.28e-02 2.78e-16 4.04e+00 0s 3 2.08664036e+02 1.42889909e+02 7.23e-04 2.22e-16 5.57e-01 0s 4 2.00126133e+02 1.99564047e+02 2.09e-13 2.59e-16 4.76e-03 0s 5 2.00000015e+02 1.99999979e+02 1.54e-13 9.23e-17 3.02e-07 0s 6 2.00000000e+02 2.00000000e+02 1.06e-13 2.22e-16 3.03e-13 0s Barrier solved model in 6 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: 35 x [1, 2, 3, 4, 7] 63 x [2, 4, 7, 8, 10] 2 x [2, 3, 7, 9, 10] 13 x [2, 5, 6, 7, 9] 3 x [3, 4, 5, 7, 10] 79 x [4, 6, 7, 9, 10] 1 x [3, 5, 7, 8, 10] 4 x [3, 6, 7, 7, 9]