Build (method = -2) #dp: 432 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 839.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.74784063e+03 -4.36296740e+03 5.31e+02 2.22e-16 1.96e+02 0s 1 7.77703569e+02 -1.89421481e+03 2.99e+01 2.22e-16 3.29e+01 0s 2 4.03134915e+02 2.52629179e+01 3.32e-02 7.27e-15 3.97e+00 0s 3 2.56827099e+02 1.89402272e+02 6.32e-04 1.55e-15 7.03e-01 0s 4 2.50093481e+02 2.46370525e+02 1.94e-06 2.22e-16 3.88e-02 0s 5 2.50000053e+02 2.49999752e+02 4.14e-12 2.22e-16 3.14e-06 0s 6 2.50000000e+02 2.50000000e+02 3.66e-14 1.47e-16 5.30e-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: 33 x [2, 4, 5, 9] 98 x [1, 4, 5, 7] 1 x [1, 2, 5, 9] 29 x [2, 5, 8, 10] 9 x [1, 4, 7, 9] 6 x [1, 3, 7, 9] 6 x [1, 6, 7, 9] 68 x [6, 8, 8, 10]