Build (method = -2) #dp: 1860 Step-3' Graph: 110 vertices and 751 arcs (0.01s) Step-4' Graph: 54 vertices and 639 arcs (0.01s) #V4/#V3 = 0.49 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 102 rows, 640 columns and 1817 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.01s Presolved: 93 rows, 630 columns, 1713 nonzeros Variable types: 0 continuous, 630 integer (462 binary) Found heuristic solution: objective 41.0000000 Optimize a model with 93 rows, 630 columns and 1713 nonzeros Presolved: 93 rows, 630 columns, 1713 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.570e+02 Factor NZ : 1.996e+03 Factor Ops : 5.396e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.52351274e+03 -2.41138169e+03 5.82e+03 2.68e-01 1.79e+01 0s 1 3.35352987e+02 -8.17259221e+02 8.94e+02 4.44e-16 2.98e+00 0s 2 6.73379795e+01 -1.84194764e+02 7.69e+01 4.44e-16 3.55e-01 0s 3 3.30400556e+01 -1.85932327e+01 6.77e+00 4.44e-16 5.11e-02 0s 4 2.47884251e+01 3.89230625e+00 1.21e+00 4.44e-16 1.76e-02 0s 5 2.16327057e+01 1.57975898e+01 1.62e-01 4.44e-16 4.68e-03 0s 6 2.06920443e+01 1.84015422e+01 3.92e-02 6.66e-16 1.82e-03 0s 7 2.04314108e+01 1.92417581e+01 2.03e-02 2.22e-16 9.45e-04 0s 8 2.02054000e+01 1.93396448e+01 7.03e-03 3.33e-16 6.84e-04 0s 9 2.01624391e+01 1.95206922e+01 5.02e-03 4.44e-16 5.07e-04 0s 10 2.00630678e+01 1.98642103e+01 1.03e-03 3.33e-16 1.57e-04 0s 11 2.00207762e+01 1.99543979e+01 2.44e-04 4.44e-16 5.23e-05 0s 12 2.00061785e+01 1.99859343e+01 4.62e-05 4.44e-16 1.60e-05 0s 13 2.00010703e+01 1.99976209e+01 2.37e-06 3.33e-16 2.72e-06 0s 14 2.00000392e+01 1.99999620e+01 1.09e-08 3.33e-16 6.08e-08 0s 15 2.00000000e+01 2.00000000e+01 2.81e-12 4.44e-16 9.53e-12 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 20 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 (20 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.05 seconds Objective: 20 Solution: 1 x [43, 44, 47] 1 x [42, 44, 48] 1 x [2, 41, 45] 1 x [3, 40, 46] 1 x [3, 7, 37] 1 x [7, 9, 35] 1 x [14, 34, 48] 1 x [19, 32, 45] 1 x [6, 15, 32] 1 x [4, 18, 31] 1 x [10, 15, 30] 1 x [14, 18, 29] 1 x [12, 21, 26] 1 x [8, 23, 25] 1 x [16, 21, 22] 1 x [11, 27, 39] 1 x [1, 17, 33] 1 x [5, 20, 24] 1 x [13, 36, 48] 1 x [28, 38, 45]