Build (method = -2) #dp: 3568 Step-3' Graph: 88 vertices and 921 arcs (0.02s) Step-4' Graph: 88 vertices and 921 arcs (0.02s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 108 rows, 922 columns and 2616 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 106 rows, 920 columns, 2612 nonzeros Variable types: 0 continuous, 920 integer (0 binary) Found heuristic solution: objective 336.0000000 Found heuristic solution: objective 271.0000000 Optimize a model with 106 rows, 920 columns and 2612 nonzeros Presolved: 106 rows, 920 columns, 2612 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.686e+03 Factor NZ : 3.734e+03 Factor Ops : 1.707e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.81168540e+03 -3.43621603e+04 1.64e+04 2.22e-16 1.97e+02 0s 1 1.45617017e+03 -2.02348063e+04 2.81e+03 5.55e-16 3.90e+01 0s 2 5.99715233e+02 -7.67031959e+03 4.87e+02 1.78e-14 8.02e+00 0s 3 3.60265498e+02 -1.60684582e+03 1.28e-13 2.00e-15 1.06e+00 0s 4 3.10589996e+02 -5.17237960e+02 2.98e-13 8.88e-16 4.45e-01 0s 5 2.71856448e+02 -3.67869044e+02 4.05e-13 6.66e-16 3.44e-01 0s 6 1.98061610e+02 -1.31376300e+02 1.00e-13 4.44e-16 1.77e-01 0s 7 1.35836832e+02 -2.54641984e+01 5.33e-14 4.53e-16 8.67e-02 0s 8 9.48190860e+01 2.78101569e+01 6.04e-14 3.64e-16 3.60e-02 0s 9 8.37849696e+01 4.35170313e+01 5.82e-13 3.86e-16 2.16e-02 0s 10 7.94076310e+01 5.47167253e+01 3.40e-13 3.59e-16 1.33e-02 0s 11 7.42412956e+01 6.45699554e+01 1.26e-13 3.50e-16 5.20e-03 0s 12 7.24253486e+01 6.78902030e+01 3.05e-12 3.29e-16 2.44e-03 0s 13 7.14537271e+01 6.93920892e+01 1.70e-12 3.33e-16 1.11e-03 0s 14 7.06405277e+01 7.04260183e+01 3.08e-12 3.37e-16 1.15e-04 0s 15 7.05503055e+01 7.05454334e+01 4.74e-13 3.33e-16 2.62e-06 0s 16 7.05500003e+01 7.05499954e+01 3.50e-12 3.33e-16 2.62e-09 0s 17 7.05500000e+01 7.05500000e+01 7.35e-13 3.55e-16 2.98e-15 0s Barrier solved model in 17 iterations and 0.01 seconds Optimal objective 7.05500000e+01 Root relaxation: objective 7.055000e+01, 689 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 70.55000 0 35 271.00000 70.55000 74.0% - 0s H 0 0 72.0000000 70.55000 2.01% - 0s H 0 0 71.0000000 70.55000 0.63% - 0s Explored 0 nodes (1380 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.100000000000e+01, best bound 7.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.09 seconds Total run time: 0.12 seconds Objective: 71 Solution: 4 x [1, 5, 11, 18, 19] 2 x [9, 9, 11, 13, 13, 13, 13, 15, 17, 18, 20] 10 x [2, 2, 10] 12 x [6, 8, 14, 15] 1 x [6, 8, 9, 14, 20] 4 x [6, 8, 8, 9, 20] 2 x [1, 1, 6, 7] 1 x [3, 3, 6, 7, 11] 13 x [5, 6, 7, 9, 11, 16] 6 x [4, 5, 9, 12, 16, 17] 3 x [5, 11, 12, 12, 13, 13, 13, 13, 15, 20] 1 x [9, 12, 12, 12, 20] 8 x [3, 3, 11, 14, 14] 1 x [1, 9, 11, 17, 17] 1 x [1, 1, 11, 13, 13, 13, 15, 17] 2 x [1, 1, 1, 5, 9, 16]