Build (method = -2) #dp: 324 Step-3' Graph: 42 vertices and 116 arcs (0.00s) Step-4' Graph: 6 vertices and 44 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 45 columns and 130 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 43 columns, 126 nonzeros Variable types: 0 continuous, 43 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 870.0000000 Optimize a model with 14 rows, 43 columns and 126 nonzeros Presolved: 14 rows, 43 columns, 126 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.500e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.75534063e+03 -4.36304760e+03 5.34e+02 2.22e-16 1.96e+02 0s 1 7.86471143e+02 -1.91531614e+03 3.16e+01 3.33e-16 3.34e+01 0s 2 4.05743571e+02 3.21876384e+01 1.87e-02 1.44e-15 3.92e+00 0s 3 2.54337719e+02 1.99044178e+02 2.74e-04 2.78e-16 5.76e-01 0s 4 2.50134639e+02 2.47252332e+02 9.11e-06 2.22e-16 3.00e-02 0s 5 2.50000026e+02 2.49999666e+02 6.88e-12 1.74e-16 3.75e-06 0s 6 2.50000000e+02 2.50000000e+02 1.02e-13 2.22e-16 4.54e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 250.0000000 250.00000 0.0% - 0s Explored 0 nodes (36 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+02, best bound 2.500000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 250 Solution: 5 x [1, 2, 6, 7] 3 x [1, 2, 3, 4] 24 x [1, 2, 8, 9] 3 x [1, 3, 4, 8] 4 x [1, 3, 4, 5] 91 x [1, 3, 4, 10] 72 x [2, 5, 6, 6] 48 x [2, 4, 8, 9]