Build (method = -2) #dp: 1880 Step-3' Graph: 107 vertices and 749 arcs (0.01s) Step-4' Graph: 52 vertices and 639 arcs (0.01s) #V4/#V3 = 0.49 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 101 rows, 640 columns and 1821 nonzeros Presolve removed 11 rows and 14 columns Presolve time: 0.01s Presolved: 90 rows, 626 columns, 1752 nonzeros Variable types: 0 continuous, 626 integer (467 binary) Found heuristic solution: objective 45.0000000 Optimize a model with 90 rows, 626 columns and 1752 nonzeros Presolved: 90 rows, 626 columns, 1752 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.130e+02 Factor NZ : 2.066e+03 Factor Ops : 5.887e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.05244037e+02 -2.73005347e+03 7.84e+03 2.73e-01 2.30e+01 0s 1 1.97335532e+02 -8.35865265e+02 9.75e+02 6.66e-16 3.19e+00 0s 2 5.95881022e+01 -1.79117751e+02 9.78e+01 6.66e-16 4.04e-01 0s 3 3.22242547e+01 -3.09515342e+01 7.24e+00 6.66e-16 6.24e-02 0s 4 2.60641428e+01 -5.32575420e+00 2.09e+00 4.44e-16 2.74e-02 0s 5 2.37600932e+01 1.25164509e+01 8.80e-01 6.66e-16 9.48e-03 0s 6 2.14607744e+01 1.74037234e+01 2.88e-01 6.73e-16 3.36e-03 0s 7 2.05180961e+01 1.91759464e+01 8.91e-02 1.11e-15 1.10e-03 0s 8 2.02552227e+01 1.97620853e+01 3.61e-02 6.66e-16 4.06e-04 0s 9 2.01388065e+01 1.98799868e+01 1.76e-02 6.66e-16 2.13e-04 0s 10 2.00288064e+01 1.99697129e+01 2.57e-03 6.66e-16 4.79e-05 0s 11 2.00068532e+01 1.99962956e+01 4.49e-04 9.99e-16 8.55e-06 0s 12 2.00022576e+01 1.99986538e+01 1.31e-04 5.55e-16 2.91e-06 0s 13 2.00002686e+01 1.99998458e+01 1.32e-05 6.66e-16 3.40e-07 0s 14 2.00000022e+01 1.99999992e+01 1.05e-07 1.33e-15 2.38e-09 0s 15 2.00000000e+01 2.00000000e+01 1.09e-13 9.99e-16 2.73e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 15 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 (15 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 [20, 44, 46] 1 x [2, 15, 45] 1 x [1, 3, 33] 1 x [11, 28, 44] 1 x [13, 26, 48] 1 x [18, 25, 45] 1 x [16, 24, 49] 1 x [7, 8, 24] 1 x [1, 17, 23] 1 x [8, 14, 21] 1 x [3, 6, 30] 1 x [19, 38, 46] 1 x [4, 36, 43] 1 x [9, 29, 47] 1 x [32, 42, 46] 1 x [5, 40, 41] 1 x [10, 34, 41] 1 x [12, 37, 39] 1 x [17, 31, 39] 1 x [22, 27, 35]