Build (method = -2) #dp: 6957 Step-3' Graph: 97 vertices and 280 arcs (0.03s) Step-4' Graph: 7 vertices and 100 arcs (0.03s) #V4/#V3 = 0.07 #A4/#A3 = 0.36 Ready! (0.03s) Optimize a model with 26 rows, 101 columns and 297 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 24 rows, 99 columns, 293 nonzeros Variable types: 0 continuous, 99 integer (0 binary) Found heuristic solution: objective 1999.0000000 Found heuristic solution: objective 1875.0000000 Optimize a model with 24 rows, 99 columns and 293 nonzeros Presolved: 24 rows, 99 columns, 293 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.020e+02 Factor NZ : 3.000e+02 Factor Ops : 4.900e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.72339735e+03 -1.27785745e+04 9.23e+02 1.11e-16 2.69e+02 0s 1 1.33542356e+03 -5.56938170e+03 1.53e-12 4.44e-16 3.33e+01 0s 2 8.99393240e+02 -7.41050977e+02 3.41e-13 4.30e-16 7.74e+00 0s 3 4.69004432e+02 2.31702017e+02 2.17e-13 2.22e-16 1.09e+00 0s 4 4.05227766e+02 3.90775675e+02 5.40e-13 2.22e-16 6.66e-02 0s 5 4.00007162e+02 3.99983673e+02 2.96e-13 2.22e-16 1.08e-04 0s 6 4.00000000e+02 4.00000000e+02 1.45e-13 3.33e-16 1.10e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+02 Root relaxation: objective 4.000000e+02, 88 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 400.0000000 400.00000 0.0% - 0s Explored 0 nodes (88 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+02, best bound 4.000000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.00 seconds Total run time: 0.04 seconds Objective: 400 Solution: 24 x [3, 5, 6, 7, 12] 101 x [1, 5, 7, 8, 12] 4 x [1, 3, 13, 16, 17] 69 x [8, 11, 16, 17, 19] 3 x [7, 8, 12, 16, 17] 33 x [10, 12, 15, 17, 18] 50 x [3, 9, 13, 14, 17] 2 x [6, 12, 14, 15, 17] 1 x [3, 4, 6, 11, 14] 102 x [2, 3, 4, 6, 10] 1 x [3, 6, 7, 8, 13] 10 x [1, 7, 10, 11, 12]