Build (method = -2) #dp: 145 Step-3' Graph: 21 vertices and 77 arcs (0.00s) Step-4' Graph: 13 vertices and 61 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 32 rows, 62 columns and 167 nonzeros Presolve removed 29 rows and 57 columns Presolve time: 0.00s Presolved: 3 rows, 5 columns, 10 nonzeros Variable types: 0 continuous, 5 integer (0 binary) Found heuristic solution: objective 1480.0000000 Optimize a model with 3 rows, 5 columns and 10 nonzeros Presolved: 3 rows, 5 columns, 10 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.000e+00 Factor NZ : 6.000e+00 Factor Ops : 1.400e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.48442199e+03 1.44020950e+03 6.67e-01 5.55e-17 5.17e+00 0s 1 1.47509401e+03 1.46899694e+03 0.00e+00 1.11e-16 4.69e-01 0s 2 1.47300518e+03 1.47290334e+03 0.00e+00 1.11e-16 7.83e-03 0s 3 1.47300001e+03 1.47299990e+03 0.00e+00 3.25e-19 7.83e-06 0s 4 1.47300000e+03 1.47300000e+03 0.00e+00 7.87e-18 7.83e-09 0s 5 1.47300000e+03 1.47300000e+03 0.00e+00 2.97e-19 7.85e-15 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.47300000e+03 Root relaxation: objective 1.473000e+03, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 1473.0000000 1473.00000 0.0% - 0s Explored 0 nodes (5 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.473000000000e+03, best bound 1.473000000000e+03, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 1473 Solution: 117 x [15] 23 x [17] 167 x [1] 141 x [5] 115 x [4] 51 x [12] 5 x [14] 3 x [6, 10] 29 x [3, 6] 128 x [6, 11] 40 x [2, 3] 17 x [9] 86 x [9, 18] 2 x [9, 10] 1 x [8, 9] 17 x [8, 8, 9] 327 x [19] 57 x [10, 19] 127 x [13, 16] 12 x [7, 16] 8 x [7, 13]