Build (method = -2) #dp: 2624 Step-3' Graph: 72 vertices and 207 arcs (0.01s) Step-4' Graph: 16 vertices and 95 arcs (0.01s) #V4/#V3 = 0.22 #A4/#A3 = 0.46 Ready! (0.01s) Optimize a model with 26 rows, 96 columns and 266 nonzeros Presolve removed 3 rows and 5 columns Presolve time: 0.00s Presolved: 23 rows, 91 columns, 256 nonzeros Variable types: 0 continuous, 91 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 825.0000000 Optimize a model with 23 rows, 91 columns and 256 nonzeros Presolved: 23 rows, 91 columns, 256 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.110e+02 Factor NZ : 2.130e+02 Factor Ops : 2.371e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.69456444e+03 -1.25985733e+04 4.01e+03 2.22e-16 4.32e+02 0s 1 1.25577112e+03 -5.89350886e+03 3.39e+02 5.55e-16 5.87e+01 0s 2 5.29039297e+02 -7.98170161e+02 2.49e-13 4.44e-16 6.92e+00 0s 3 2.23503885e+02 -3.81129765e+01 2.77e-13 4.44e-16 1.36e+00 0s 4 1.58155177e+02 9.83559251e+01 8.88e-14 2.49e-16 3.11e-01 0s 5 1.44401574e+02 1.37900137e+02 2.12e-13 4.44e-16 3.39e-02 0s 6 1.42858586e+02 1.42854243e+02 3.43e-13 2.80e-16 2.26e-05 0s 7 1.42857143e+02 1.42857143e+02 8.91e-14 3.31e-16 2.29e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+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 142.85714 0 12 825.00000 142.85714 82.7% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Explored 0 nodes (83 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.430000000000e+02, best bound 1.430000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 143 Solution: 1 x [1, 4, 5, 7, 8, 9, 10] 25 x [1, 2, 3, 5, 7, 8, 10] 51 x [4, 4, 6, 7, 7, 8, 10] 49 x [2, 6, 7, 8, 9, 10, 10] 1 x [1, 2, 5, 7, 8, 9] 5 x [4, 5, 6, 7, 7, 8, 9] 1 x [1, 2, 5, 7, 7, 7, 9] 10 x [4, 4, 5, 7, 7, 7, 8]