Build (method = -2) #dp: 934 Step-3' Graph: 54 vertices and 505 arcs (0.00s) Step-4' Graph: 48 vertices and 493 arcs (0.01s) #V4/#V3 = 0.89 #A4/#A3 = 0.98 Ready! (0.01s) Optimize a model with 87 rows, 494 columns and 1391 nonzeros Presolve removed 28 rows and 32 columns Presolve time: 0.01s Presolved: 59 rows, 462 columns, 1328 nonzeros Variable types: 0 continuous, 462 integer (280 binary) Found heuristic solution: objective 36.0000000 Found heuristic solution: objective 32.0000000 Optimize a model with 59 rows, 462 columns and 1328 nonzeros Presolved: 59 rows, 462 columns, 1328 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.560e+02 Factor NZ : 1.380e+03 Factor Ops : 4.042e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.08360504e+03 -1.17751132e+03 1.63e+03 1.59e-01 1.07e+01 0s 1 2.62097152e+02 -3.74284554e+02 2.63e+02 4.44e-16 1.90e+00 0s 2 6.60317334e+01 -1.04293861e+02 2.67e+01 4.44e-16 2.82e-01 0s 3 3.24851443e+01 4.89340575e-01 1.81e+00 5.00e-16 3.84e-02 0s 4 2.70482204e+01 1.51588349e+01 5.07e-01 2.22e-16 1.33e-02 0s 5 2.63395110e+01 1.83135939e+01 3.89e-01 2.22e-16 8.90e-03 0s 6 2.46067910e+01 2.06661897e+01 1.90e-01 2.22e-16 4.30e-03 0s 7 2.36757135e+01 2.15685276e+01 9.32e-02 2.22e-16 2.28e-03 0s 8 2.29745190e+01 2.22181764e+01 1.36e-02 2.22e-16 8.13e-04 0s 9 2.27461243e+01 2.24762905e+01 3.79e-03 2.22e-16 2.90e-04 0s 10 2.26690490e+01 2.26585627e+01 3.57e-05 2.22e-16 1.13e-05 0s 11 2.26666691e+01 2.26666586e+01 2.47e-13 3.07e-16 1.13e-08 0s 12 2.26666667e+01 2.26666667e+01 1.13e-13 2.85e-16 1.13e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 2.26666667e+01 Root relaxation: objective 2.266667e+01, 188 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.66667 0 7 32.00000 22.66667 29.2% - 0s H 0 0 25.0000000 22.66667 9.33% - 0s H 0 0 23.0000000 22.66667 1.45% - 0s Explored 0 nodes (303 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.03 seconds Total run time: 0.04 seconds Objective: 23 Solution: 1 x [3, 39] 1 x [4, 38] 1 x [3, 37] 2 x [5, 36] 1 x [6, 35] 1 x [6, 34] 1 x [8, 33] 1 x [10, 32] 1 x [16, 31] 1 x [18, 30] 1 x [18, 29] 1 x [18, 28] 1 x [17, 28] 1 x [19, 27] 1 x [15, 27] 1 x [2, 7, 26] 1 x [20, 25] 1 x [22, 24] 1 x [1, 13, 23] 1 x [1, 16, 21] 1 x [11, 14] 1 x [8, 9, 12]