Build (method = -2) #dp: 4492 Step-3' Graph: 285 vertices and 1369 arcs (0.02s) Step-4' Graph: 115 vertices and 1029 arcs (0.03s) #V4/#V3 = 0.40 #A4/#A3 = 0.75 Ready! (0.03s) Optimize a model with 175 rows, 1030 columns and 2864 nonzeros Presolve removed 30 rows and 30 columns Presolve time: 0.03s Presolved: 145 rows, 1000 columns, 2834 nonzeros Variable types: 0 continuous, 1000 integer (850 binary) Found heuristic solution: objective 39.0000000 Optimize a model with 145 rows, 1000 columns and 2834 nonzeros Presolved: 145 rows, 1000 columns, 2834 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.434e+03 Factor NZ : 3.924e+03 Factor Ops : 1.374e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.72379700e+03 -3.62800938e+03 1.09e+04 2.84e-01 1.59e+01 0s 1 6.85110132e+02 -8.68514397e+02 1.77e+03 5.55e-16 2.62e+00 0s 2 1.00729667e+02 -1.88119079e+02 1.48e+02 5.55e-16 2.87e-01 0s 3 4.10907174e+01 -3.26198196e+01 2.77e+01 2.50e-16 5.97e-02 0s 4 2.65721926e+01 1.66892218e+00 3.86e+00 2.78e-16 1.50e-02 0s 5 2.28407663e+01 1.47046953e+01 1.10e+00 2.22e-16 4.36e-03 0s 6 2.14542092e+01 1.74949640e+01 3.25e-01 2.22e-16 2.04e-03 0s 7 2.05742594e+01 1.90371726e+01 8.76e-02 2.22e-16 7.81e-04 0s 8 2.02443032e+01 1.96023117e+01 2.71e-02 2.22e-16 3.24e-04 0s 9 2.01370128e+01 1.98304771e+01 1.22e-02 2.22e-16 1.55e-04 0s 10 2.00440198e+01 1.99276756e+01 1.59e-03 2.22e-16 5.83e-05 0s 11 2.00094968e+01 1.99856909e+01 3.88e-05 2.22e-16 1.19e-05 0s 12 2.00024545e+01 1.99957350e+01 6.05e-06 2.22e-16 3.36e-06 0s 13 2.00002763e+01 1.99997385e+01 4.59e-07 3.17e-16 2.69e-07 0s 14 2.00000004e+01 1.99999998e+01 5.55e-10 3.01e-16 2.86e-10 0s 15 2.00000000e+01 2.00000000e+01 3.32e-13 2.22e-16 3.01e-16 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 43 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 (43 simplex iterations) in 0.05 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.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.09 seconds Objective: 20 Solution: 1 x [49, 50, 51] 1 x [12, 46, 56] 1 x [34, 35, 36] 1 x [43, 44, 45] 1 x [17, 18, 31] 1 x [20, 52, 54] 1 x [19, 21, 53] 1 x [29, 37, 39] 1 x [13, 14, 15] 1 x [28, 30, 59] 1 x [10, 11, 48] 1 x [47, 55, 57] 1 x [16, 32, 33] 1 x [1, 2, 3] 1 x [8, 25, 27] 1 x [7, 9, 23] 1 x [4, 5, 6] 1 x [22, 24, 26] 1 x [38, 58, 60] 1 x [40, 41, 42]