Build (method = -2) #dp: 2449 Step-3' Graph: 115 vertices and 847 arcs (0.01s) Step-4' Graph: 48 vertices and 713 arcs (0.01s) #V4/#V3 = 0.42 #A4/#A3 = 0.84 Ready! (0.01s) Optimize a model with 108 rows, 714 columns and 2050 nonzeros Presolve removed 13 rows and 13 columns Presolve time: 0.01s Presolved: 95 rows, 701 columns, 1968 nonzeros Variable types: 0 continuous, 701 integer (625 binary) Found heuristic solution: objective 53.0000000 Optimize a model with 95 rows, 701 columns and 1968 nonzeros Presolved: 95 rows, 701 columns, 1968 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.006e+03 Factor NZ : 2.182e+03 Factor Ops : 6.386e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.36382126e+02 -2.57162823e+03 5.57e+03 2.88e-01 1.24e+01 0s 1 1.85455869e+02 -6.74840023e+02 7.37e+02 2.89e-15 1.84e+00 0s 2 5.00490786e+01 -9.68303302e+01 8.23e+01 1.75e-15 2.33e-01 0s 3 2.70567169e+01 -4.80373195e+00 4.93e+00 3.11e-15 2.91e-02 0s 4 2.32949544e+01 1.14717922e+01 3.52e-01 2.00e-15 8.68e-03 0s 5 2.13649157e+01 1.77824335e+01 8.56e-02 1.55e-15 2.59e-03 0s 6 2.05530787e+01 1.86086082e+01 2.10e-02 1.57e-15 1.40e-03 0s 7 2.03591376e+01 1.94217788e+01 1.12e-02 1.55e-15 6.73e-04 0s 8 2.01221504e+01 1.98361496e+01 2.56e-03 1.67e-15 2.05e-04 0s 9 2.00559959e+01 1.99432884e+01 9.87e-04 1.37e-15 8.07e-05 0s 10 2.00108007e+01 1.99821107e+01 7.86e-05 2.24e-15 2.05e-05 0s 11 2.00034597e+01 1.99945663e+01 1.80e-05 2.22e-15 6.35e-06 0s 12 2.00004513e+01 1.99989825e+01 6.05e-07 1.39e-15 1.05e-06 0s 13 2.00000134e+01 1.99999914e+01 1.28e-13 1.89e-15 1.57e-08 0s 14 2.00000000e+01 2.00000000e+01 4.60e-12 2.53e-15 1.57e-11 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 26 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 (26 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.04 seconds Objective: 20 Solution: 1 x [10, 11, 12] 1 x [4, 5, 6] 1 x [1, 17, 26] 1 x [55, 56, 57] 1 x [34, 35, 36] 1 x [43, 44, 45] 1 x [49, 50, 53] 1 x [14, 25, 38] 1 x [2, 19, 21] 1 x [22, 23, 24] 1 x [3, 28, 30] 1 x [31, 32, 33] 1 x [13, 20, 39] 1 x [40, 41, 42] 1 x [16, 29, 37] 1 x [15, 18, 27] 1 x [58, 59, 60] 1 x [51, 52, 54] 1 x [46, 47, 48] 1 x [7, 8, 9]