Build (method = -2) #dp: 2850 Step-3' Graph: 567 vertices and 1694 arcs (0.02s) Step-4' Graph: 229 vertices and 1018 arcs (0.02s) #V4/#V3 = 0.40 #A4/#A3 = 0.60 Ready! (0.02s) Optimize a model with 268 rows, 1019 columns and 2603 nonzeros Presolve removed 39 rows and 65 columns Presolve time: 0.01s Presolved: 229 rows, 954 columns, 2525 nonzeros Variable types: 0 continuous, 954 integer (14 binary) Found heuristic solution: objective 288.0000000 Optimize a model with 229 rows, 954 columns and 2525 nonzeros Presolved: 229 rows, 954 columns, 2525 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.697e+03 Factor NZ : 5.671e+03 Factor Ops : 1.725e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.70107215e+03 -1.98922590e+04 3.07e+04 2.22e-16 8.88e+01 0s 1 9.17994762e+02 -9.50131595e+03 4.65e+03 9.99e-16 1.58e+01 0s 2 4.18982518e+02 -2.60441725e+03 5.58e+02 1.55e-15 2.54e+00 0s 3 3.17622285e+02 -6.28842543e+02 4.44e+01 4.44e-15 5.40e-01 0s 4 2.69527253e+02 -3.53358822e+02 3.78e+00 2.22e-15 3.26e-01 0s 5 2.45432551e+02 -1.27481721e+02 2.32e+00 1.44e-15 1.95e-01 0s 6 2.17066398e+02 -1.76912286e+01 1.16e+00 8.88e-16 1.22e-01 0s 7 1.99096460e+02 6.53170768e+01 5.93e-01 5.93e-16 6.96e-02 0s 8 1.84332520e+02 1.35814829e+02 1.98e-01 4.44e-16 2.52e-02 0s 9 1.75222814e+02 1.60798447e+02 4.00e-02 4.58e-16 7.48e-03 0s 10 1.72782151e+02 1.68643591e+02 9.06e-03 4.47e-16 2.15e-03 0s 11 1.72068215e+02 1.71116949e+02 9.05e-04 4.52e-16 4.93e-04 0s 12 1.72007557e+02 1.71989196e+02 6.61e-05 5.55e-16 9.54e-06 0s 13 1.72000001e+02 1.71999998e+02 1.15e-08 4.44e-16 1.77e-09 0s 14 1.72000000e+02 1.72000000e+02 1.49e-11 5.88e-16 1.86e-15 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.72000000e+02 Root relaxation: objective 1.720000e+02, 423 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 172.0000000 172.00000 0.0% - 0s Explored 0 nodes (423 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.720000000000e+02, best bound 1.720000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.08 seconds Objective: 172 Solution: 1 x [1, 34] 6 x [2, 33] 7 x [3, 30] 8 x [3, 33] 1 x [3, 34, 39] 13 x [4, 34, 38] 2 x [5, 31] 7 x [5, 32] 1 x [5, 33, 38] 2 x [5, 35] 1 x [6, 27] 4 x [7, 26] 8 x [7, 28] 8 x [8, 28] 11 x [8, 29] 5 x [9, 26] 8 x [10, 22] 6 x [10, 23] 5 x [10, 24] 2 x [11, 24] 1 x [12, 24, 39] 3 x [13, 21] 7 x [13, 22] 2 x [14, 17] 1 x [14, 18] 8 x [15, 17] 4 x [15, 19, 38] 6 x [16, 17] 6 x [16, 18, 37] 3 x [16, 19, 36] 3 x [17, 19] 1 x [18, 20, 35] 3 x [20, 25, 29] 2 x [20, 25, 31] 3 x [21, 23, 28] 8 x [21, 25, 26] 5 x [23, 24, 27, 39]