Build (method = -2) #dp: 1430 Step-3' Graph: 72 vertices and 406 arcs (0.01s) Step-4' Graph: 42 vertices and 346 arcs (0.01s) #V4/#V3 = 0.58 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 79 rows, 347 columns and 962 nonzeros Presolve removed 19 rows and 28 columns Presolve time: 0.01s Presolved: 60 rows, 319 columns, 886 nonzeros Variable types: 0 continuous, 319 integer (169 binary) Found heuristic solution: objective 32.0000000 Optimize a model with 60 rows, 319 columns and 886 nonzeros Presolved: 60 rows, 319 columns, 886 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.240e+02 Factor NZ : 1.123e+03 Factor Ops : 2.522e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.95961574e+02 -1.15256148e+03 1.46e+03 2.50e-01 1.47e+01 0s 1 1.65787373e+02 -3.74638902e+02 2.61e+02 6.66e-16 2.74e+00 0s 2 4.65559353e+01 -8.86424166e+01 1.98e+01 6.66e-16 3.23e-01 0s 3 2.99425116e+01 -3.51248541e+00 8.82e-01 2.95e-16 5.46e-02 0s 4 2.33507190e+01 1.14217257e+01 1.80e-01 2.22e-16 1.87e-02 0s 5 2.13785191e+01 1.50305825e+01 6.32e-02 3.33e-16 9.88e-03 0s 6 2.03037826e+01 1.83865061e+01 1.62e-02 2.22e-16 2.97e-03 0s 7 1.98806414e+01 1.92016417e+01 4.33e-03 2.22e-16 1.05e-03 0s 8 1.97072703e+01 1.94556912e+01 5.25e-04 2.22e-16 3.90e-04 0s 9 1.96634652e+01 1.95818726e+01 1.30e-04 2.22e-16 1.26e-04 0s 10 1.96491893e+01 1.96428588e+01 2.12e-05 2.22e-16 9.81e-06 0s 11 1.96459341e+01 1.96457503e+01 4.32e-07 2.22e-16 2.85e-07 0s 12 1.96458336e+01 1.96458332e+01 9.99e-12 2.22e-16 5.45e-10 0s 13 1.96458333e+01 1.96458333e+01 4.95e-12 2.22e-16 5.67e-16 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.96458333e+01 Root relaxation: objective 1.964583e+01, 46 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 19.64583 0 31 32.00000 19.64583 38.6% - 0s H 0 0 22.0000000 19.64583 10.7% - 0s H 0 0 20.0000000 19.64583 1.77% - 0s Explored 0 nodes (63 simplex iterations) in 0.02 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.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 20 Solution: 1 x [17, 37] 1 x [18, 36] 1 x [16, 35] 1 x [3, 8, 34] 1 x [19, 33] 1 x [19, 32] 1 x [4, 12, 31] 1 x [5, 10, 31] 1 x [2, 13, 30] 1 x [11, 30] 1 x [1, 15, 29] 1 x [6, 9, 28] 1 x [7, 11, 27] 1 x [20, 26] 1 x [4, 14, 26] 1 x [22, 25] 1 x [23, 24] 1 x [21, 24] 1 x [10, 16, 20] 1 x [1, 15, 20]