Build (method = -2) #dp: 3011 Step-3' Graph: 78 vertices and 224 arcs (0.01s) Step-4' Graph: 6 vertices and 80 arcs (0.01s) #V4/#V3 = 0.08 #A4/#A3 = 0.36 Ready! (0.01s) Optimize a model with 25 rows, 81 columns and 238 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 23 rows, 79 columns, 234 nonzeros Variable types: 0 continuous, 79 integer (0 binary) Found heuristic solution: objective 1999.0000000 Found heuristic solution: objective 1927.0000000 Optimize a model with 23 rows, 79 columns and 234 nonzeros Presolved: 23 rows, 79 columns, 234 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.100e+01 Factor NZ : 2.760e+02 Factor Ops : 4.324e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.82515585e+03 -9.16425152e+03 5.97e+02 0.00e+00 2.28e+02 0s 1 1.58349678e+03 -3.62861202e+03 3.61e+01 3.33e-16 3.62e+01 0s 2 8.15075916e+02 8.29384793e+01 1.48e-02 1.05e-14 4.18e+00 0s 3 5.26287949e+02 3.97692656e+02 8.96e-04 1.69e-15 7.27e-01 0s 4 5.02688752e+02 4.93185629e+02 9.90e-05 2.22e-16 5.37e-02 0s 5 5.00215553e+02 4.99882343e+02 9.07e-06 2.22e-16 1.88e-03 0s 6 5.00000000e+02 4.99999999e+02 7.04e-12 1.11e-16 1.06e-08 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+02 Root relaxation: objective 5.000000e+02, 68 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 500.0000000 500.00000 0.0% - 0s Explored 0 nodes (68 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+02, best bound 5.000000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 500 Solution: 4 x [8, 9, 12, 18] 14 x [2, 4, 8, 18] 1 x [4, 11, 16, 18] 53 x [7, 11, 15, 18] 1 x [6, 16, 17, 18] 86 x [9, 11, 14, 19] 2 x [7, 9, 12, 15] 106 x [4, 8, 11, 13] 7 x [3, 4, 6, 10] 96 x [3, 5, 11, 17] 11 x [10, 11, 14, 17] 28 x [3, 6, 8, 15] 3 x [3, 6, 15, 17] 1 x [6, 9, 15, 16] 21 x [1, 9, 14, 15] 66 x [9, 10, 15, 16]