Build (method = -2) #dp: 272 Step-3' Graph: 38 vertices and 104 arcs (0.00s) Step-4' Graph: 6 vertices and 40 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 15 rows, 41 columns and 118 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 39 columns, 114 nonzeros Variable types: 0 continuous, 39 integer (4 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 950.0000000 Optimize a model with 13 rows, 39 columns and 114 nonzeros Presolved: 13 rows, 39 columns, 114 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.100e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.96321176e+03 -4.36419912e+03 1.33e+03 5.24e-02 3.08e+02 0s 1 9.55750178e+02 -1.97772716e+03 9.42e+01 3.33e-16 4.48e+01 0s 2 4.40968917e+02 -4.00001555e+00 1.47e+00 9.77e-15 5.22e+00 0s 3 2.67862222e+02 1.95467053e+02 1.31e-01 1.67e-15 8.41e-01 0s 4 2.51259265e+02 2.46624863e+02 9.94e-03 2.22e-16 5.38e-02 0s 5 2.50107425e+02 2.49846289e+02 1.38e-03 1.11e-16 3.01e-03 0s 6 2.50000003e+02 2.49999986e+02 9.74e-14 2.22e-16 1.93e-07 0s 7 2.50000000e+02 2.50000000e+02 8.45e-14 3.33e-16 1.95e-13 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.50000000e+02 Root relaxation: objective 2.500000e+02, 32 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 (32 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: 49 x [1, 3, 7, 8] 19 x [1, 3, 4, 9] 120 x [2, 3, 7, 9] 52 x [3, 4, 7, 9] 1 x [1, 3, 5, 7] 6 x [1, 4, 7, 9] 2 x [4, 5, 7, 9] 1 x [4, 5, 6, 7]