Build (method = -2) #dp: 2911 Step-3' Graph: 351 vertices and 1521 arcs (0.02s) Step-4' Graph: 344 vertices and 1507 arcs (0.02s) #V4/#V3 = 0.98 #A4/#A3 = 0.99 Ready! (0.02s) Optimize a model with 364 rows, 1508 columns and 3849 nonzeros Presolve removed 110 rows and 199 columns Presolve time: 0.02s Presolved: 254 rows, 1309 columns, 3553 nonzeros Variable types: 0 continuous, 1309 integer (0 binary) Found heuristic solution: objective 156.0000000 Optimize a model with 254 rows, 1309 columns and 3553 nonzeros Presolved: 254 rows, 1309 columns, 3553 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.081e+03 Factor NZ : 8.500e+03 Factor Ops : 4.074e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.11454354e+03 -2.70782212e+04 2.31e+04 2.22e-16 8.01e+01 0s 1 4.12896096e+02 -1.52763893e+04 3.62e+03 6.66e-16 1.55e+01 0s 2 2.35865793e+02 -6.10212935e+03 4.21e+02 5.77e-15 3.27e+00 0s 3 2.19807123e+02 -8.29421403e+02 2.85e+01 3.66e-15 4.35e-01 0s 4 1.97814054e+02 -2.95455529e+02 1.99e+00 1.22e-15 1.89e-01 0s 5 1.73669246e+02 -1.88617813e+02 1.16e+00 8.88e-16 1.39e-01 0s 6 1.56698858e+02 -1.22900131e+02 7.66e-01 6.66e-16 1.07e-01 0s 7 1.30340097e+02 -4.74226801e+01 4.12e-01 3.87e-16 6.78e-02 0s 8 1.04595780e+02 1.71340853e+01 1.67e-01 4.44e-16 3.33e-02 0s 9 9.17186515e+01 6.91230624e+01 5.66e-02 2.60e-16 8.62e-03 0s 10 8.55976911e+01 8.27045690e+01 1.03e-02 4.62e-16 1.10e-03 0s 11 8.40341104e+01 8.39015587e+01 2.86e-04 2.80e-16 5.05e-05 0s 12 8.40000025e+01 8.39999962e+01 1.69e-08 3.26e-16 2.43e-09 0s 13 8.40000000e+01 8.40000000e+01 2.02e-12 3.33e-16 2.87e-15 0s Barrier solved model in 13 iterations and 0.03 seconds Optimal objective 8.40000000e+01 Root relaxation: objective 8.400000e+01, 407 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 84.0000000 84.00000 0.0% - 0s Explored 0 nodes (911 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.400000000000e+01, best bound 8.400000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.14 seconds Objective: 84 Solution: 7 x [5, 17] 3 x [7, 17] 7 x [7, 14, 17] 1 x [1, 3] 7 x [1, 3, 20] 10 x [6, 12, 15, 20] 1 x [6, 8] 1 x [6, 7, 7] 1 x [8, 18] 5 x [8, 14, 18] 8 x [2] 1 x [9, 10] 7 x [9, 19] 7 x [4, 13] 5 x [4, 11] 7 x [9, 11] 6 x [16, 16]