Build (method = -2) #dp: 2211 Step-3' Graph: 112 vertices and 369 arcs (0.01s) Step-4' Graph: 71 vertices and 287 arcs (0.01s) #V4/#V3 = 0.63 #A4/#A3 = 0.78 Ready! (0.01s) Optimize a model with 81 rows, 288 columns and 727 nonzeros Presolve removed 16 rows and 31 columns Presolve time: 0.00s Presolved: 65 rows, 257 columns, 674 nonzeros Variable types: 0 continuous, 257 integer (0 binary) Found heuristic solution: objective 870.0000000 Found heuristic solution: objective 494.0000000 Optimize a model with 65 rows, 257 columns and 674 nonzeros Presolved: 65 rows, 257 columns, 674 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.970e+02 Factor NZ : 1.117e+03 Factor Ops : 2.172e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.95914164e+03 -6.24977342e+04 3.42e+04 2.22e-16 7.02e+02 0s 1 2.16084220e+03 -2.67106576e+04 4.43e+03 1.55e-15 1.15e+02 0s 2 1.00925266e+03 -5.96884914e+03 3.67e+02 1.55e-15 1.62e+01 0s 3 6.67185976e+02 -6.31981416e+02 9.43e-01 9.16e-16 2.48e+00 0s 4 3.97000494e+02 -2.06582241e+02 4.01e-01 1.42e-15 1.15e+00 0s 5 1.95757833e+02 -6.13062632e+01 1.32e-01 1.06e-15 4.91e-01 0s 6 1.63571016e+02 4.70704443e+01 6.82e-02 1.21e-15 2.22e-01 0s 7 1.65234474e+02 9.74101488e+01 4.91e-02 9.76e-16 1.29e-01 0s 8 1.44587538e+02 1.39409381e+02 1.73e-03 8.46e-16 9.88e-03 0s 9 1.42885516e+02 1.42768570e+02 3.17e-05 1.02e-15 2.23e-04 0s 10 1.42857171e+02 1.42857054e+02 5.42e-13 8.67e-16 2.23e-07 0s 11 1.42857143e+02 1.42857143e+02 6.48e-13 1.26e-15 2.23e-10 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 146 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 17 494.00000 142.85714 71.1% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Explored 0 nodes (212 simplex iterations) in 0.01 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.01 seconds Total run time: 0.03 seconds Objective: 143 Solution: 3 x [1, 2, 4, 5, 8, 8, 9] 5 x [1, 2, 4, 5, 7, 7, 9] 59 x [2, 3, 4, 5, 8, 9, 10] 1 x [2, 4, 4, 5, 6, 9] 1 x [2, 3, 4, 4, 4, 6, 9] 1 x [1, 2, 5, 7, 8, 8, 9] 38 x [2, 3, 3, 5, 8, 8, 9] 25 x [1, 2, 2, 3, 4, 7, 7] 10 x [1, 2, 2, 2, 5, 7, 7]