Build (method = -2) #dp: 96 Step-3' Graph: 17 vertices and 57 arcs (0.00s) Step-4' Graph: 12 vertices and 47 arcs (0.00s) #V4/#V3 = 0.71 #A4/#A3 = 0.82 Ready! (0.00s) Optimize a model with 22 rows, 48 columns and 127 nonzeros Presolve removed 6 rows and 8 columns Presolve time: 0.00s Presolved: 16 rows, 40 columns, 105 nonzeros Variable types: 0 continuous, 40 integer (7 binary) Found heuristic solution: objective 88.0000000 Found heuristic solution: objective 82.0000000 Found heuristic solution: objective 71.0000000 Optimize a model with 16 rows, 40 columns and 105 nonzeros Presolved: 16 rows, 40 columns, 105 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.600e+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.45217936e+02 -3.04295927e+02 8.64e+01 1.06e-01 1.70e+01 0s 1 8.68669928e+01 -8.72548574e+01 5.28e+00 2.22e-16 2.46e+00 0s 2 5.85311903e+01 2.83768597e+01 3.10e-01 2.22e-16 3.61e-01 0s 3 4.82426251e+01 4.59053558e+01 1.07e-02 1.67e-16 2.75e-02 0s 4 4.75047229e+01 4.74919203e+01 2.46e-13 2.70e-16 1.51e-04 0s 5 4.75000000e+01 4.75000000e+01 5.33e-14 2.22e-16 3.01e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.75000000e+01 Root relaxation: objective 4.750000e+01, 18 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 47.50000 0 3 71.00000 47.50000 33.1% - 0s H 0 0 48.0000000 47.50000 1.04% - 0s Explored 0 nodes (18 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.800000000000e+01, best bound 4.800000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 48 Solution: 4 x [4] 15 x [7] 1 x [7, 10] 1 x [1, 9] 3 x [3, 3] 3 x [1, 2, 6] 5 x [5, 6, 8] 1 x [5, 6] 14 x [1, 2, 8] 1 x [1, 1, 2]