Build (method = -2) #dp: 25796 Step-3' Graph: 329 vertices and 1319 arcs (0.14s) Step-4' Graph: 218 vertices and 1097 arcs (0.14s) #V4/#V3 = 0.66 #A4/#A3 = 0.83 Ready! (0.14s) Optimize a model with 237 rows, 1098 columns and 2868 nonzeros Presolve removed 28 rows and 58 columns Presolve time: 0.01s Presolved: 209 rows, 1040 columns, 2786 nonzeros Variable types: 0 continuous, 1040 integer (0 binary) Found heuristic solution: objective 1920.0000000 Found heuristic solution: objective 1620.0000000 Optimize a model with 209 rows, 1040 columns and 2786 nonzeros Presolved: 209 rows, 1040 columns, 2786 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.735e+03 Factor NZ : 5.746e+03 Factor Ops : 1.857e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.62312632e+04 -1.90950692e+05 1.60e+05 2.22e-16 6.04e+02 0s 1 4.00897972e+03 -6.38010590e+04 2.20e+04 6.66e-16 9.45e+01 0s 2 2.12280280e+03 -2.24411915e+04 4.57e+03 1.22e-15 2.24e+01 0s 3 1.62129427e+03 -4.54050281e+03 2.43e+02 9.77e-15 3.28e+00 0s 4 9.98013633e+02 -1.49455889e+03 5.64e+01 3.44e-15 1.24e+00 0s 5 8.75106048e+02 -1.03051307e+03 4.56e+01 2.22e-15 9.44e-01 0s 6 5.38917990e+02 -3.99899232e+02 1.99e+01 1.11e-15 4.60e-01 0s 7 4.18842358e+02 -1.32977156e+02 1.16e+01 5.55e-16 2.69e-01 0s 8 3.73669290e+02 5.33708301e+01 7.14e+00 4.44e-16 1.56e-01 0s 9 3.12309618e+02 2.29300263e+02 2.46e+00 3.08e-16 4.04e-02 0s 10 2.99112404e+02 2.68608624e+02 1.15e+00 3.17e-16 1.49e-02 0s 11 2.93176312e+02 2.78231877e+02 7.52e-01 3.33e-16 7.30e-03 0s 12 2.88865208e+02 2.84105570e+02 1.73e-02 2.22e-16 2.27e-03 0s 13 2.85744919e+02 2.85234455e+02 1.11e-03 2.71e-16 2.43e-04 0s 14 2.85714386e+02 2.85714028e+02 5.00e-09 3.33e-16 1.71e-07 0s 15 2.85714286e+02 2.85714285e+02 4.23e-13 3.33e-16 1.71e-10 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.85714286e+02 Root relaxation: objective 2.857143e+02, 711 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 285.71429 0 31 1620.00000 285.71429 82.4% - 0s H 0 0 289.0000000 285.71429 1.14% - 0s H 0 0 287.0000000 285.71429 0.45% - 0s H 0 0 286.0000000 285.71429 0.10% - 0s Explored 0 nodes (958 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.860000000000e+02, best bound 2.860000000000e+02, gap 0.0% Preprocessing time: 0.16 seconds Gurobi run time: 0.07 seconds Total run time: 0.22 seconds Objective: 286 Solution: 16 x [6, 9, 9, 13, 14, 17, 19] 24 x [1, 3, 6, 8, 11, 12, 12] 13 x [6, 8, 12, 12, 14, 14, 19] 4 x [5, 6, 11, 12, 12, 12, 14] 30 x [6, 6, 8, 14, 14, 17, 18] 50 x [4, 6, 6, 8, 11, 12, 14] 1 x [3, 6, 6, 8, 11, 12] 1 x [3, 6, 6, 8, 11, 12, 12] 1 x [5, 6, 6, 11, 14, 14, 17] 21 x [2, 2, 2, 2, 14, 16, 18] 35 x [9, 9, 9, 11, 17, 18, 19] 21 x [2, 2, 9, 10, 17, 18, 18] 1 x [9, 9, 17, 18, 18, 18] 16 x [9, 9, 17, 18, 18, 18, 18] 9 x [2, 2, 2, 2, 7, 8, 13] 4 x [2, 2, 2, 2, 9, 17, 19] 39 x [11, 13, 14, 15, 15, 17, 19]