Build (method = -2) #dp: 5512 Step-3' Graph: 62 vertices and 1025 arcs (0.03s) Step-4' Graph: 50 vertices and 1001 arcs (0.03s) #V4/#V3 = 0.81 #A4/#A3 = 0.98 Ready! (0.03s) Optimize a model with 110 rows, 1002 columns and 2915 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.02s Presolved: 107 rows, 998 columns, 2907 nonzeros Variable types: 0 continuous, 998 integer (121 binary) Found heuristic solution: objective 307.0000000 Found heuristic solution: objective 284.0000000 Optimize a model with 107 rows, 998 columns and 2907 nonzeros Presolved: 107 rows, 998 columns, 2907 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.342e+03 Factor NZ : 2.615e+03 Factor Ops : 8.264e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.44684429e+03 -1.18645969e+04 7.61e+03 8.60e-02 7.46e+01 0s 1 1.69314466e+03 -5.44295680e+03 1.17e+03 6.66e-16 1.29e+01 0s 2 4.08194748e+02 -2.37281003e+03 1.02e+02 1.78e-15 2.01e+00 0s 3 2.60919134e+02 -3.84554047e+02 1.02e+01 2.11e-15 3.42e-01 0s 4 1.41372929e+02 -1.15924649e+02 1.19e+00 7.77e-16 1.27e-01 0s 5 1.17516553e+02 -7.29472983e+01 8.82e-01 4.44e-16 9.40e-02 0s 6 8.02889762e+01 -2.89105440e+00 4.03e-01 2.22e-16 4.09e-02 0s 7 7.34269951e+01 1.89797586e+01 3.04e-01 2.69e-16 2.67e-02 0s 8 6.35778213e+01 5.01397258e+01 1.07e-01 3.33e-16 6.56e-03 0s 9 6.02177789e+01 5.52514899e+01 4.01e-02 2.51e-16 2.42e-03 0s 10 5.79311481e+01 5.77751416e+01 3.42e-04 2.22e-16 7.60e-05 0s 11 5.79000091e+01 5.78998991e+01 8.59e-08 3.33e-16 5.36e-08 0s 12 5.79000000e+01 5.78999999e+01 2.30e-13 2.52e-16 5.36e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 5.79000000e+01 Root relaxation: objective 5.790000e+01, 798 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 57.90000 0 38 284.00000 57.90000 79.6% - 0s H 0 0 59.0000000 57.90000 1.86% - 0s 0 0 57.90000 0 58 59.00000 57.90000 1.86% - 0s H 0 0 58.0000000 57.90000 0.17% - 0s Cutting planes: Gomory: 1 Zero half: 1 Explored 0 nodes (1148 simplex iterations) in 0.14 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.800000000000e+01, best bound 5.800000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.14 seconds Total run time: 0.18 seconds Objective: 58 Solution: 1 x [6, 31, 55, 58] 1 x [20, 39, 47, 51, 58] 4 x [24, 28, 29, 37, 49, 52] 1 x [9, 33, 47, 51, 52] 2 x [3, 8, 32, 52, 55] 1 x [9, 17, 21, 36, 52] 1 x [5, 11, 31, 48, 56] 1 x [17, 21, 27, 39, 48] 3 x [35, 43, 48, 49, 55] 2 x [32, 35, 37, 48, 59] 6 x [4, 11, 29, 45, 56] 1 x [5, 11, 26, 32, 45] 2 x [17, 22, 33, 45, 51] 1 x [2, 10, 24, 45, 51] 2 x [17, 25, 26, 44, 57] 1 x [11, 24, 25, 26, 27, 54] 4 x [25, 27, 33, 38, 46, 50] 1 x [5, 24, 25, 35, 54, 60] 2 x [8, 16, 32, 41, 55] 1 x [12, 13, 41, 47, 54] 5 x [12, 19, 23, 34, 39, 59] 3 x [13, 14, 23, 30, 34, 59] 2 x [4, 13, 13, 18, 27, 37] 1 x [10, 15, 20, 27, 42, 44] 1 x [12, 17, 32, 40, 43] 2 x [12, 21, 40, 43, 55] 2 x [1, 1, 10, 40, 42, 46] 1 x [1, 1, 8, 12, 27, 40] 1 x [7, 9, 9, 34, 36, 53] 2 x [9, 9, 9, 19, 53, 53]