Build (method = -2) #dp: 2075 Step-3' Graph: 116 vertices and 833 arcs (0.01s) Step-4' Graph: 54 vertices and 709 arcs (0.01s) #V4/#V3 = 0.47 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 105 rows, 710 columns and 2026 nonzeros Presolve removed 10 rows and 13 columns Presolve time: 0.02s Presolved: 95 rows, 697 columns, 1884 nonzeros Variable types: 0 continuous, 697 integer (537 binary) Found heuristic solution: objective 44.0000000 Optimize a model with 95 rows, 697 columns and 1884 nonzeros Presolved: 95 rows, 697 columns, 1884 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.700e+02 Factor NZ : 2.336e+03 Factor Ops : 7.426e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.85074796e+03 -4.21991764e+03 4.94e+03 2.93e-01 2.20e+01 0s 1 3.87288582e+02 -1.26234515e+03 6.49e+02 1.04e-14 3.27e+00 0s 2 8.82535469e+01 -1.85963991e+02 5.82e+01 4.44e-15 3.60e-01 0s 3 3.87357178e+01 -2.66519026e+01 4.87e+00 6.44e-15 5.74e-02 0s 4 3.10239484e+01 -1.85953672e+00 2.28e+00 4.58e-15 2.67e-02 0s 5 2.66715281e+01 5.15438578e+00 1.08e+00 4.99e-15 1.65e-02 0s 6 2.37914781e+01 1.59824340e+01 5.57e-01 4.33e-15 5.87e-03 0s 7 2.12387761e+01 1.84539827e+01 1.64e-01 6.66e-15 2.06e-03 0s 8 2.04174529e+01 1.95773781e+01 4.29e-02 4.55e-15 6.15e-04 0s 9 2.01980492e+01 1.97946201e+01 1.90e-02 4.20e-15 2.94e-04 0s 10 2.00895507e+01 1.99363595e+01 7.48e-03 3.98e-15 1.12e-04 0s 11 2.00357433e+01 1.99644830e+01 2.48e-03 6.22e-15 5.16e-05 0s 12 2.00077829e+01 1.99908817e+01 4.30e-04 3.35e-15 1.22e-05 0s 13 2.00013840e+01 1.99986463e+01 6.45e-05 3.11e-15 1.97e-06 0s 14 2.00000642e+01 1.99999698e+01 2.29e-06 5.77e-15 6.80e-08 0s 15 2.00000000e+01 2.00000000e+01 6.25e-10 5.66e-15 2.13e-11 0s Barrier solved model in 15 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 20.00000 0 37 44.00000 20.00000 54.5% - 0s H 0 0 22.0000000 20.00000 9.09% - 0s H 0 0 21.0000000 20.00000 4.76% - 0s * 0 0 0 20.0000000 20.00000 0.0% - 0s Cutting planes: Gomory: 2 Clique: 1 Zero half: 9 Explored 0 nodes (79 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.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 20 Solution: 1 x [14, 48, 50] 1 x [44, 49, 50] 1 x [3, 43, 47] 1 x [6, 41, 48] 1 x [1, 4, 40] 1 x [3, 7, 37] 1 x [15, 32, 51] 1 x [2, 16, 31] 1 x [9, 13, 29] 1 x [1, 20, 27] 1 x [5, 20, 25] 1 x [11, 17, 24] 1 x [11, 19, 23] 1 x [12, 22, 36] 1 x [8, 26, 33] 1 x [10, 42, 49] 1 x [20, 28, 45] 1 x [18, 34, 46] 1 x [26, 30, 39] 1 x [21, 35, 38]