Build (method = -2) #dp: 60 Step-3' Graph: 13 vertices and 38 arcs (0.00s) Step-4' Graph: 8 vertices and 28 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.74 Ready! (0.00s) Optimize a model with 18 rows, 29 columns and 78 nonzeros Presolve removed 14 rows and 22 columns Presolve time: 0.00s Presolved: 4 rows, 7 columns, 16 nonzeros Variable types: 0 continuous, 7 integer (0 binary) Found heuristic solution: objective 807.0000000 Found heuristic solution: objective 805.0000000 Found heuristic solution: objective 803.0000000 Found heuristic solution: objective 801.0000000 Optimize a model with 4 rows, 7 columns and 16 nonzeros Presolve removed 3 rows and 5 columns Presolved: 1 rows, 2 columns, 2 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 0.000e+00 Factor NZ : 1.000e+00 Factor Ops : 1.000e+00 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.45698726e+02 5.69515591e+02 0.00e+00 0.00e+00 7.43e+01 0s 1 7.79039559e+02 7.38517183e+02 0.00e+00 2.22e-16 8.29e+00 0s 2 7.57468115e+02 7.56693008e+02 0.00e+00 2.22e-16 1.55e-01 0s 3 7.57000469e+02 7.56999694e+02 0.00e+00 2.22e-16 1.55e-04 0s 4 7.57000000e+02 7.57000000e+02 0.00e+00 0.00e+00 1.55e-07 0s 5 7.57000000e+02 7.57000000e+02 0.00e+00 2.22e-16 1.56e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 7.57000000e+02 Root relaxation: objective 7.570000e+02, 3 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 757.0000000 757.00000 0.0% - 0s Explored 0 nodes (3 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.570000000000e+02, best bound 7.570000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 757 Solution: 147 x [7] 120 x [1] 137 x [5] 24 x [10] 45 x [9, 10] 86 x [8] 12 x [2, 8] 3 x [6, 8] 132 x [2, 4] 51 x [3, 3]