Build (method = -2) #dp: 60 Step-3' Graph: 10 vertices and 30 arcs (0.00s) Step-4' Graph: 9 vertices and 28 arcs (0.00s) #V4/#V3 = 0.90 #A4/#A3 = 0.93 Ready! (0.00s) Optimize a model with 19 rows, 29 columns and 76 nonzeros Presolve removed 10 rows and 11 columns Presolve time: 0.00s Presolved: 9 rows, 18 columns, 47 nonzeros Variable types: 0 continuous, 18 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 635.0000000 Optimize a model with 9 rows, 18 columns and 47 nonzeros Presolved: 9 rows, 18 columns, 47 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.200e+01 Factor NZ : 4.500e+01 Factor Ops : 2.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.52353236e+02 -8.50115251e+02 2.63e+02 2.22e-16 6.17e+01 0s 1 6.64291245e+02 3.17428771e+02 1.31e+00 1.94e-16 9.03e+00 0s 2 5.54980533e+02 5.14119942e+02 6.19e-02 6.94e-17 1.05e+00 0s 3 5.50288704e+02 5.49790717e+02 1.14e-12 2.22e-16 1.28e-02 0s 4 5.50000290e+02 5.49999792e+02 9.09e-13 3.38e-16 1.28e-05 0s 5 5.50000000e+02 5.50000000e+02 5.12e-13 1.11e-16 1.28e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.50000000e+02 Root relaxation: objective 5.500000e+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 550.0000000 550.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 5.500000000000e+02, best bound 5.500000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 550 Solution: 21 x [3] 24 x [3, 10] 114 x [6, 10] 45 x [1, 8] 62 x [8, 10] 79 x [2, 9] 15 x [7] 116 x [1, 7] 48 x [5] 10 x [5, 9] 16 x [4]