Build (method = -2) #dp: 363 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 971.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.62784063e+03 -4.36161680e+03 4.95e+02 2.22e-16 1.86e+02 0s 1 6.52589738e+02 -1.73296888e+03 3.37e+00 2.22e-16 2.61e+01 0s 2 4.27561218e+02 -3.10003772e+02 3.40e-01 3.89e-16 7.81e+00 0s 3 2.63995994e+02 2.00071534e+02 9.95e-14 3.05e-16 6.66e-01 0s 4 2.50344323e+02 2.48165972e+02 3.22e-13 2.22e-16 2.27e-02 0s 5 2.50000189e+02 2.49999803e+02 6.08e-14 4.44e-16 4.02e-06 0s 6 2.50000000e+02 2.50000000e+02 8.04e-14 3.33e-16 4.04e-12 0s Barrier solved model in 6 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: 29 x [1, 8, 9, 10] 2 x [1, 4, 7, 8] 28 x [1, 8, 9, 9] 3 x [1, 4, 6, 7] 6 x [2, 3, 7, 9] 66 x [1, 5, 7, 9] 19 x [4, 6, 9, 9] 97 x [1, 2, 3, 5]