Build (method = -2) #dp: 407 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 888.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.54534063e+03 -4.36060810e+03 4.71e+02 1.11e-16 1.80e+02 0s 1 6.44609529e+02 -1.63250971e+03 4.12e-13 2.22e-16 2.46e+01 0s 2 3.98294428e+02 -1.44837724e+01 1.46e-13 2.22e-16 4.35e+00 0s 3 2.51204667e+02 2.15111089e+02 2.84e-14 1.11e-16 3.76e-01 0s 4 2.50005407e+02 2.49965158e+02 7.89e-14 2.22e-16 4.19e-04 0s 5 2.50000000e+02 2.50000000e+02 2.26e-13 1.11e-16 4.23e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 35 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 (35 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: 78 x [3, 6, 7, 9] 1 x [2, 3, 7, 8] 23 x [1, 7, 8, 10] 9 x [2, 7, 9, 10] 1 x [2, 7, 8, 9] 3 x [1, 2, 3, 8] 52 x [1, 3, 4, 9] 44 x [2, 3, 8, 10] 33 x [1, 5, 9, 10] 6 x [1, 2, 9, 9]