Build (method = -2) #dp: 97 Step-3' Graph: 21 vertices and 66 arcs (0.00s) Step-4' Graph: 14 vertices and 52 arcs (0.00s) #V4/#V3 = 0.67 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 24 rows, 53 columns and 138 nonzeros Presolve removed 12 rows and 24 columns Presolve time: 0.00s Presolved: 12 rows, 29 columns, 73 nonzeros Variable types: 0 continuous, 29 integer (0 binary) Found heuristic solution: objective 789.0000000 Optimize a model with 12 rows, 29 columns and 73 nonzeros Presolved: 12 rows, 29 columns, 73 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.400e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.39592644e+03 -1.34439439e+03 6.06e+02 2.22e-16 8.96e+01 0s 1 8.19166807e+02 1.08204987e+02 1.23e-02 2.78e-16 1.17e+01 0s 2 6.62510251e+02 5.23636379e+02 5.33e-04 2.22e-16 2.28e+00 0s 3 6.20778898e+02 6.06034524e+02 3.00e-05 1.11e-16 2.42e-01 0s 4 6.17067917e+02 6.16892905e+02 1.29e-13 2.22e-16 2.87e-03 0s 5 6.17000001e+02 6.16999999e+02 2.27e-13 1.11e-16 2.74e-08 0s 6 6.17000000e+02 6.17000000e+02 1.47e-13 2.22e-16 2.79e-14 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 6.17000000e+02 Root relaxation: objective 6.170000e+02, 12 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 617.0000000 617.00000 0.0% - 0s Explored 0 nodes (12 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.170000000000e+02, best bound 6.170000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 617 Solution: 4 x [3] 94 x [3, 6] 145 x [7] 136 x [2] 9 x [2, 8] 18 x [4, 10] 103 x [1, 10] 57 x [5, 9] 12 x [1, 4, 9] 39 x [1, 4, 4]