Build (method = -2) #dp: 3011 Step-3' Graph: 177 vertices and 962 arcs (0.01s) Step-4' Graph: 80 vertices and 768 arcs (0.01s) #V4/#V3 = 0.45 #A4/#A3 = 0.80 Ready! (0.01s) Optimize a model with 130 rows, 769 columns and 2151 nonzeros Presolve removed 39 rows and 39 columns Presolve time: 0.01s Presolved: 91 rows, 730 columns, 2054 nonzeros Variable types: 0 continuous, 730 integer (632 binary) Found heuristic solution: objective 38.0000000 Optimize a model with 91 rows, 730 columns and 2054 nonzeros Presolved: 91 rows, 730 columns, 2054 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.006e+03 Factor NZ : 2.462e+03 Factor Ops : 8.334e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.74528147e+03 -1.53490807e+03 2.38e+03 2.03e-01 8.01e+00 0s 1 4.27345679e+02 -5.14762995e+02 4.74e+02 4.44e-16 1.71e+00 0s 2 8.90721394e+01 -1.05467465e+02 5.45e+01 4.44e-16 2.40e-01 0s 3 3.15323856e+01 -4.69699281e+00 4.34e+00 3.33e-16 3.18e-02 0s 4 2.44561631e+01 1.66090073e+01 3.29e-01 2.22e-16 5.53e-03 0s 5 2.26684135e+01 1.93396266e+01 1.04e-01 2.22e-16 2.30e-03 0s 6 2.19163473e+01 2.01581448e+01 3.85e-02 1.55e-16 1.21e-03 0s 7 2.14413713e+01 2.06997585e+01 1.03e-02 2.22e-16 5.08e-04 0s 8 2.12691986e+01 2.09598638e+01 3.31e-03 2.22e-16 2.12e-04 0s 9 2.11909934e+01 2.11126367e+01 1.20e-03 2.22e-16 5.36e-05 0s 10 2.11680224e+01 2.11562529e+01 4.54e-05 2.22e-16 8.06e-06 0s 11 2.11666727e+01 2.11666509e+01 6.30e-13 2.22e-16 1.49e-08 0s 12 2.11666667e+01 2.11666667e+01 6.75e-13 2.22e-16 1.49e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 2.11666667e+01 Root relaxation: objective 2.116667e+01, 372 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.16667 0 17 38.00000 21.16667 44.3% - 0s H 0 0 24.0000000 21.16667 11.8% - 0s H 0 0 22.0000000 21.16667 3.79% - 0s Explored 0 nodes (668 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 22 Solution: 1 x [11, 50] 1 x [17, 49] 1 x [19, 47] 1 x [1, 8, 48] 1 x [20, 44] 1 x [22, 43] 1 x [18, 45] 1 x [3, 10, 42] 1 x [15, 46] 1 x [23, 41] 1 x [26, 40] 1 x [28, 39] 1 x [29, 38] 1 x [34, 35] 1 x [33, 36] 1 x [31, 37] 1 x [13, 30] 1 x [27, 32] 1 x [5, 7, 25] 1 x [2, 16, 24] 1 x [9, 12, 21] 1 x [4, 6, 14]