Build (method = -2) #dp: 358 Step-3' Graph: 44 vertices and 122 arcs (0.00s) Step-4' Graph: 8 vertices and 50 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.41 Ready! (0.00s) Optimize a model with 18 rows, 51 columns and 144 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 16 rows, 49 columns, 140 nonzeros Variable types: 0 continuous, 49 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 858.0000000 Optimize a model with 16 rows, 49 columns and 140 nonzeros Presolved: 16 rows, 49 columns, 140 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.400e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.62754675e+03 -4.12821249e+03 8.49e+02 2.22e-16 1.73e+02 0s 1 7.50002308e+02 -1.65981834e+03 4.68e+01 4.44e-16 2.70e+01 0s 2 4.02446708e+02 1.23227300e+01 6.53e-02 5.88e-15 3.64e+00 0s 3 2.59748697e+02 2.03941648e+02 4.05e-03 1.17e-15 5.17e-01 0s 4 2.50154502e+02 2.47405780e+02 6.55e-14 6.66e-16 2.55e-02 0s 5 2.50002033e+02 2.49978764e+02 5.28e-14 7.77e-16 2.15e-04 0s 6 2.50000000e+02 2.50000000e+02 3.48e-14 1.11e-15 2.89e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 39 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 (39 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: 23 x [2, 5, 9, 9] 65 x [2, 4, 8, 10] 1 x [2, 6, 7, 8] 2 x [2, 4, 7, 8] 51 x [1, 2, 4, 9] 4 x [5, 6, 8, 10] 10 x [7, 8, 9, 10] 93 x [6, 6, 7, 9] 1 x [3, 3, 7, 8]