Build (method = -2) #dp: 58 Step-3' Graph: 9 vertices and 29 arcs (0.00s) Step-4' Graph: 9 vertices and 29 arcs (0.00s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.00s) Optimize a model with 19 rows, 30 columns and 79 nonzeros Presolve removed 7 rows and 7 columns Presolve time: 0.00s Presolved: 12 rows, 23 columns, 60 nonzeros Variable types: 0 continuous, 23 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 750.0000000 Optimize a model with 12 rows, 23 columns and 60 nonzeros Presolved: 12 rows, 23 columns, 60 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.600e+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.43889565e+03 -1.32984477e+03 6.66e+02 1.11e-16 9.45e+01 0s 1 8.63411171e+02 2.99329721e+02 3.66e-01 1.11e-15 1.11e+01 0s 2 7.25956082e+02 6.46798773e+02 9.26e-05 4.44e-16 1.55e+00 0s 3 6.90375051e+02 6.89104213e+02 1.42e-13 5.55e-16 2.49e-02 0s 4 6.90000376e+02 6.89999105e+02 3.98e-13 3.39e-16 2.49e-05 0s 5 6.90000000e+02 6.90000000e+02 1.36e-12 5.14e-16 2.49e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.90000000e+02 Root relaxation: objective 6.900000e+02, 11 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 690.0000000 690.00000 0.0% - 0s Explored 0 nodes (11 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.900000000000e+02, best bound 6.900000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 690 Solution: 160 x [1] 19 x [4] 6 x [4, 8] 5 x [4, 7] 201 x [9] 65 x [6, 8] 83 x [5, 10] 89 x [5, 7] 47 x [2, 3] 15 x [3, 3]