Build (method = -2) #dp: 2340 Step-3' Graph: 83 vertices and 431 arcs (0.01s) Step-4' Graph: 44 vertices and 353 arcs (0.01s) #V4/#V3 = 0.53 #A4/#A3 = 0.82 Ready! (0.01s) Optimize a model with 84 rows, 354 columns and 979 nonzeros Presolve removed 14 rows and 16 columns Presolve time: 0.01s Presolved: 70 rows, 338 columns, 928 nonzeros Variable types: 0 continuous, 338 integer (222 binary) Found heuristic solution: objective 28.0000000 Optimize a model with 70 rows, 338 columns and 928 nonzeros Presolved: 70 rows, 338 columns, 928 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.860e+02 Factor NZ : 1.383e+03 Factor Ops : 3.494e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.32839560e+02 -1.34818311e+03 1.15e+03 2.32e-01 1.32e+01 0s 1 2.27670410e+02 -3.42547729e+02 2.11e+02 6.11e-16 2.41e+00 0s 2 4.92913488e+01 -8.45836009e+01 1.53e+01 5.55e-16 2.94e-01 0s 3 2.72414777e+01 7.84012410e-01 1.16e+00 7.77e-16 4.31e-02 0s 4 2.08165976e+01 9.26092131e+00 2.05e-01 5.97e-16 1.73e-02 0s 5 1.89541897e+01 1.24926935e+01 7.69e-02 5.31e-16 9.55e-03 0s 6 1.77492019e+01 1.53865082e+01 1.14e-02 5.55e-16 3.46e-03 0s 7 1.73802889e+01 1.67054764e+01 3.82e-03 5.55e-16 9.89e-04 0s 8 1.72605070e+01 1.72145859e+01 6.87e-05 4.44e-16 6.72e-05 0s 9 1.72500051e+01 1.72499653e+01 2.94e-08 5.12e-16 5.82e-08 0s 10 1.72500000e+01 1.72500000e+01 2.30e-14 5.22e-16 5.82e-11 0s 11 1.72500000e+01 1.72500000e+01 1.29e-14 8.88e-16 5.82e-14 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.72500000e+01 Root relaxation: objective 1.725000e+01, 175 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 17.25000 0 14 28.00000 17.25000 38.4% - 0s H 0 0 18.0000000 17.25000 4.17% - 0s Explored 0 nodes (343 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.800000000000e+01, best bound 1.800000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 18 Solution: 1 x [3, 15, 40] 1 x [2, 12, 39] 1 x [2, 15, 38] 1 x [5, 16, 37] 1 x [10, 13, 36] 1 x [6, 19, 35] 1 x [8, 18, 35] 1 x [7, 21, 34] 1 x [6, 22, 33] 1 x [11, 14, 33] 1 x [9, 20, 32] 1 x [10, 17, 32] 1 x [27, 31] 1 x [1, 25, 30] 1 x [27, 29] 1 x [4, 24, 28] 1 x [1, 23, 26] 1 x [16]