Build (method = -2) #dp: 5061 Step-3' Graph: 237 vertices and 1738 arcs (0.02s) Step-4' Graph: 157 vertices and 1578 arcs (0.02s) #V4/#V3 = 0.66 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 208 rows, 1579 columns and 4427 nonzeros Presolve removed 40 rows and 41 columns Presolve time: 0.01s Presolved: 168 rows, 1538 columns, 4442 nonzeros Variable types: 0 continuous, 1538 integer (1349 binary) Found heuristic solution: objective 37.0000000 Found heuristic solution: objective 35.0000000 Optimize a model with 168 rows, 1538 columns and 4442 nonzeros Presolved: 168 rows, 1538 columns, 4442 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.424e+03 Factor NZ : 5.349e+03 Factor Ops : 2.209e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.12860636e+03 -2.24966604e+03 5.53e+03 1.91e-01 1.02e+01 0s 1 6.93331000e+02 -8.46660811e+02 1.20e+03 5.55e-16 2.32e+00 0s 2 1.13236703e+02 -2.19687235e+02 1.05e+02 4.44e-16 2.52e-01 0s 3 3.36138453e+01 -2.04232390e+01 9.45e+00 4.44e-16 2.97e-02 0s 4 2.26617127e+01 5.23613839e+00 2.93e-01 3.33e-16 5.90e-03 0s 5 2.11103514e+01 1.09805222e+01 8.12e-02 2.25e-16 3.34e-03 0s 6 1.96094565e+01 1.36093772e+01 2.63e-02 2.22e-16 1.96e-03 0s 7 1.83404892e+01 1.50329924e+01 7.94e-03 2.22e-16 1.08e-03 0s 8 1.76554859e+01 1.61310489e+01 1.24e-03 2.22e-16 4.96e-04 0s 9 1.72740889e+01 1.64917663e+01 1.83e-04 4.44e-16 2.54e-04 0s 10 1.70524325e+01 1.69436406e+01 9.70e-06 2.36e-16 3.54e-05 0s 11 1.70005511e+01 1.69998021e+01 1.61e-08 2.48e-16 2.44e-07 0s 12 1.70000006e+01 1.69999998e+01 1.64e-13 2.54e-16 2.44e-10 0s 13 1.70000000e+01 1.70000000e+01 1.71e-13 4.44e-16 3.00e-16 0s Barrier solved model in 13 iterations and 0.02 seconds Optimal objective 1.70000000e+01 Root relaxation: objective 1.700000e+01, 130 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 17.0000000 17.00000 0.0% - 0s Explored 0 nodes (130 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 17 Solution: 1 x [1, 49, 51] 1 x [6, 31, 38] 1 x [13, 29, 34] 1 x [2, 41, 45] 1 x [7, 24, 42] 1 x [3, 28, 50] 1 x [17, 25, 35] 1 x [20, 23, 33] 1 x [8, 26, 40] 1 x [9, 21, 44] 1 x [10, 16, 47] 1 x [19, 22, 36] 1 x [4, 32, 48] 1 x [11, 18, 43] 1 x [12, 14, 46] 1 x [15, 27, 30] 1 x [5, 37, 39]