Build (method = -2) #dp: 2669 Step-3' Graph: 127 vertices and 891 arcs (0.01s) Step-4' Graph: 50 vertices and 737 arcs (0.01s) #V4/#V3 = 0.39 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 110 rows, 738 columns and 2118 nonzeros Presolve removed 9 rows and 9 columns Presolve time: 0.01s Presolved: 101 rows, 729 columns, 1990 nonzeros Variable types: 0 continuous, 729 integer (641 binary) Found heuristic solution: objective 54.0000000 Found heuristic solution: objective 35.0000000 Optimize a model with 101 rows, 729 columns and 1990 nonzeros Presolved: 101 rows, 729 columns, 1990 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.054e+03 Factor NZ : 2.510e+03 Factor Ops : 7.701e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.93077357e+03 -2.82375629e+03 4.30e+03 2.69e-01 1.22e+01 0s 1 3.17445090e+02 -6.92741221e+02 5.25e+02 6.66e-16 1.66e+00 0s 2 6.05735501e+01 -8.06196604e+01 5.15e+01 2.28e-15 1.86e-01 0s 3 2.75793032e+01 2.49248062e+00 3.00e+00 1.33e-15 2.15e-02 0s 4 2.27013645e+01 1.54693473e+01 1.33e-01 1.14e-15 5.04e-03 0s 5 2.09276746e+01 1.84543999e+01 2.54e-02 1.24e-15 1.70e-03 0s 6 2.03414042e+01 1.93516686e+01 7.25e-03 1.07e-15 6.81e-04 0s 7 2.02440639e+01 1.97340787e+01 4.66e-03 1.30e-15 3.51e-04 0s 8 2.00967974e+01 1.98928015e+01 1.01e-03 1.02e-15 1.40e-04 0s 9 2.00373895e+01 1.99577104e+01 3.13e-04 1.11e-15 5.47e-05 0s 10 2.00091562e+01 1.99832295e+01 4.88e-05 1.33e-15 1.78e-05 0s 11 2.00029902e+01 1.99945434e+01 1.39e-05 1.19e-15 5.80e-06 0s 12 2.00011948e+01 1.99991964e+01 4.94e-06 9.90e-16 1.37e-06 0s 13 2.00000187e+01 1.99999683e+01 4.36e-08 1.09e-15 3.46e-08 0s 14 2.00000000e+01 2.00000000e+01 4.00e-14 1.29e-15 3.46e-11 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 35 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (35 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 20 Solution: 1 x [34, 35, 36] 1 x [1, 14, 17] 1 x [2, 16, 41] 1 x [38, 55, 57] 1 x [26, 58, 59] 1 x [18, 49, 60] 1 x [13, 39, 50] 1 x [3, 27, 37] 1 x [7, 8, 9] 1 x [43, 44, 45] 1 x [6, 40, 47] 1 x [5, 25, 51] 1 x [19, 20, 21] 1 x [10, 11, 12] 1 x [22, 23, 24] 1 x [28, 29, 30] 1 x [4, 15, 42] 1 x [46, 48, 56] 1 x [52, 53, 54] 1 x [31, 32, 33]