Build (method = -2) #dp: 5564 Step-3' Graph: 130 vertices and 838 arcs (0.03s) Step-4' Graph: 74 vertices and 726 arcs (0.03s) #V4/#V3 = 0.57 #A4/#A3 = 0.87 Ready! (0.03s) Optimize a model with 136 rows, 727 columns and 2037 nonzeros Presolve removed 24 rows and 27 columns Presolve time: 0.02s Presolved: 112 rows, 700 columns, 1990 nonzeros Variable types: 0 continuous, 700 integer (389 binary) Found heuristic solution: objective 73.0000000 Found heuristic solution: objective 66.0000000 Optimize a model with 112 rows, 700 columns and 1990 nonzeros Presolved: 112 rows, 700 columns, 1990 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.404e+03 Factor NZ : 2.797e+03 Factor Ops : 1.024e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.95112791e+03 -8.17164645e+03 5.98e+03 2.31e-01 4.88e+01 0s 1 1.11379936e+03 -1.53160738e+03 1.00e+03 8.88e-16 7.96e+00 0s 2 1.69202400e+02 -4.77601204e+02 6.27e+01 7.77e-16 8.02e-01 0s 3 8.48530076e+01 -1.16587458e+02 8.36e+00 4.44e-16 1.74e-01 0s 4 5.13204791e+01 -2.28272434e+01 1.23e+00 6.66e-16 5.53e-02 0s 5 4.37652364e+01 1.18897133e+01 6.41e-01 5.59e-16 2.32e-02 0s 6 3.73112803e+01 2.24845986e+01 2.51e-01 5.46e-16 1.06e-02 0s 7 3.44524337e+01 2.95048116e+01 7.70e-02 6.66e-16 3.50e-03 0s 8 3.34924799e+01 3.23249090e+01 1.58e-02 6.66e-16 8.23e-04 0s 9 3.33627442e+01 3.32487613e+01 1.32e-03 6.66e-16 8.03e-05 0s 10 3.33333778e+01 3.33330967e+01 2.26e-13 2.94e-16 1.98e-07 0s 11 3.33333334e+01 3.33333331e+01 3.56e-13 3.28e-16 1.98e-10 0s 12 3.33333333e+01 3.33333333e+01 4.65e-13 4.44e-16 1.98e-13 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 542 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 23 66.00000 33.33333 49.5% - 0s H 0 0 35.0000000 33.33333 4.76% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (955 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 34 Solution: 1 x [8, 10, 62] 1 x [6, 61] 2 x [13, 23, 60] 1 x [1, 31, 59] 1 x [11, 29, 58] 1 x [13, 26, 58] 1 x [16, 21, 58] 1 x [6, 34, 57] 1 x [18, 22, 56] 1 x [19, 56] 2 x [12, 32, 55] 1 x [14, 28, 55] 1 x [4, 39, 54] 1 x [11, 33, 54] 2 x [3, 40, 53] 1 x [2, 42, 52] 1 x [17, 24, 52] 1 x [9, 38, 51] 1 x [18, 27, 50] 1 x [15, 34, 49] 1 x [21, 26, 48] 1 x [5, 44, 47] 1 x [4, 44, 47] 1 x [7, 41, 47] 1 x [17, 34, 46] 1 x [20, 30, 45] 1 x [25, 28, 43] 1 x [18, 34, 42] 1 x [27, 27, 42] 1 x [20, 35, 37] 1 x [21, 34, 36]