Build (method = -2) #dp: 3501 Step-3' Graph: 41 vertices and 769 arcs (0.01s) Step-4' Graph: 41 vertices and 769 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 101 rows, 770 columns and 2256 nonzeros Presolve removed 25 rows and 25 columns Presolve time: 0.01s Presolved: 76 rows, 745 columns, 2183 nonzeros Variable types: 0 continuous, 745 integer (32 binary) Found heuristic solution: objective 1059.0000000 Found heuristic solution: objective 867.0000000 Optimize a model with 76 rows, 745 columns and 2183 nonzeros Presolved: 76 rows, 745 columns, 2183 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.253e+03 Factor NZ : 1.911e+03 Factor Ops : 6.639e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.47402942e+04 -1.78263559e+04 1.16e+04 4.31e-02 2.36e+02 0s 1 3.41641215e+03 -1.15341242e+04 1.25e+03 5.55e-16 3.16e+01 0s 2 1.17342161e+03 -3.83623180e+03 7.02e+01 1.60e-14 4.10e+00 0s 3 8.34236938e+02 -6.59361270e+02 6.98e+00 3.33e-15 1.01e+00 0s 4 5.81271915e+02 1.22481836e+02 1.05e+00 8.88e-16 3.04e-01 0s 5 5.20990315e+02 2.72484799e+02 4.35e-01 4.44e-16 1.64e-01 0s 6 4.88853987e+02 3.95155961e+02 1.61e-01 2.22e-16 6.17e-02 0s 7 4.72910338e+02 4.36147824e+02 6.20e-02 3.33e-16 2.42e-02 0s 8 4.67661227e+02 4.53830004e+02 2.33e-02 1.74e-16 9.09e-03 0s 9 4.63890713e+02 4.57886774e+02 5.30e-03 2.22e-16 3.94e-03 0s 10 4.63067382e+02 4.61944319e+02 3.86e-04 2.22e-16 7.37e-04 0s 11 4.63001987e+02 4.62997424e+02 3.71e-07 4.44e-16 2.99e-06 0s 12 4.63000002e+02 4.62999997e+02 2.88e-13 3.33e-16 2.99e-09 0s 13 4.63000000e+02 4.63000000e+02 9.95e-13 2.22e-16 2.99e-12 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 4.63000000e+02 Root relaxation: objective 4.630000e+02, 319 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 463.0000000 463.00000 0.0% - 0s Explored 0 nodes (360 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.630000000000e+02, best bound 4.630000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 463 Solution: 2 x [11, 52] 9 x [30] 13 x [11, 30] 8 x [30, 51, 51] 1 x [30, 51, 51, 59, 59] 7 x [6] 25 x [5, 6] 2 x [6, 11] 10 x [35, 39] 1 x [1, 39] 23 x [1, 39, 59] 1 x [1, 20] 17 x [3, 50] 4 x [43, 45] 15 x [4, 16, 34] 14 x [40, 49] 10 x [40, 41] 2 x [29, 40] 6 x [25, 46] 3 x [29, 46] 1 x [3, 11, 46] 5 x [31, 42] 10 x [27, 29] 1 x [27, 29, 34] 22 x [9, 42] 5 x [2, 37] 20 x [10, 54] 4 x [44, 55] 6 x [19, 22, 55] 18 x [16, 17, 47] 21 x [23, 43, 53] 11 x [22, 23, 60] 1 x [3, 17, 23] 4 x [18, 24] 2 x [11, 24, 58] 4 x [13, 24, 32] 1 x [17, 24, 33] 1 x [14, 26] 25 x [13, 14, 38] 1 x [14, 17, 43] 2 x [14, 17, 22] 30 x [12, 18] 3 x [15, 56] 18 x [7, 21] 7 x [7, 15] 21 x [8, 36] 1 x [28, 36] 3 x [15, 36] 9 x [8, 15] 12 x [21, 28] 5 x [26, 53, 57] 10 x [3, 19, 26, 38] 1 x [29, 37, 48] 1 x [3, 13, 37, 53] 4 x [13, 37, 53, 53]