Build (method = -2) #dp: 3890 Step-3' Graph: 400 vertices and 1674 arcs (0.02s) Step-4' Graph: 319 vertices and 1512 arcs (0.02s) #V4/#V3 = 0.80 #A4/#A3 = 0.90 Ready! (0.02s) Optimize a model with 329 rows, 1513 columns and 3913 nonzeros Presolve removed 45 rows and 89 columns Presolve time: 0.01s Presolved: 284 rows, 1424 columns, 3773 nonzeros Variable types: 0 continuous, 1424 integer (0 binary) Found heuristic solution: objective 76.0000000 Optimize a model with 284 rows, 1424 columns and 3773 nonzeros Presolved: 284 rows, 1424 columns, 3773 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.200e+03 Factor NZ : 7.919e+03 Factor Ops : 2.562e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.87534261e+02 -2.61133501e+04 1.91e+04 2.22e-16 5.93e+01 0s 1 2.46346336e+02 -1.31060278e+04 2.97e+03 1.22e-15 1.12e+01 0s 2 1.59734973e+02 -5.17996266e+03 1.00e+03 5.55e-16 3.65e+00 0s 3 1.14068154e+02 -1.35569274e+03 2.33e+02 7.11e-15 8.50e-01 0s 4 9.94731997e+01 -3.00923000e+02 1.21e-01 6.66e-15 1.40e-01 0s 5 9.80698608e+01 -9.86965566e+01 2.85e-04 2.89e-15 6.89e-02 0s 6 8.07832870e+01 -1.11256768e+02 2.07e-04 2.44e-15 6.72e-02 0s 7 6.09145670e+01 -5.86957333e+01 1.28e-04 1.46e-15 4.19e-02 0s 8 3.55675937e+01 -1.24783679e+01 7.12e-05 9.00e-16 1.68e-02 0s 9 3.20683114e+01 -6.61690071e+00 6.22e-05 1.25e-15 1.35e-02 0s 10 2.27857667e+01 -7.09415500e-01 4.02e-05 1.28e-15 8.22e-03 0s 11 1.69531135e+01 3.67398045e+00 2.33e-05 1.04e-15 4.65e-03 0s 12 1.43942317e+01 8.03069193e+00 1.11e-05 9.09e-16 2.23e-03 0s 13 1.46697837e+01 8.67149296e+00 6.34e-06 1.24e-15 2.10e-03 0s 14 1.27103580e+01 9.68206282e+00 2.61e-06 1.37e-15 1.06e-03 0s 15 1.24191611e+01 1.10971578e+01 1.61e-06 1.08e-15 4.63e-04 0s 16 1.19321898e+01 1.14829729e+01 4.62e-07 1.02e-15 1.57e-04 0s 17 1.17940637e+01 1.15879185e+01 1.88e-07 9.78e-16 7.21e-05 0s 18 1.16977638e+01 1.16451369e+01 2.03e-08 1.02e-15 1.84e-05 0s 19 1.16798949e+01 1.16582161e+01 4.94e-09 9.72e-16 7.59e-06 0s 20 1.16722217e+01 1.16682663e+01 4.53e-10 9.34e-16 1.38e-06 0s 21 1.16710232e+01 1.16709162e+01 3.36e-12 8.54e-16 3.75e-08 0s 22 1.16710000e+01 1.16710000e+01 8.63e-13 9.99e-16 5.68e-13 0s Barrier solved model in 22 iterations and 0.03 seconds Optimal objective 1.16710000e+01 Root relaxation: objective 1.167100e+01, 232 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.67100 0 45 76.00000 11.67100 84.6% - 0s H 0 0 13.0000000 11.67100 10.2% - 0s H 0 0 12.0000000 11.67100 2.74% - 0s Explored 0 nodes (474 simplex iterations) in 0.16 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.16 seconds Total run time: 0.20 seconds Objective: 12 Solution: 3 x [2, 3, 3, 3, 3, 7, 8, 8, 10] 1 x [1, 1, 4, 4, 5, 10] 2 x [4, 5, 5, 5, 6, 6, 6, 10] 1 x [2, 4, 5, 5, 7, 7, 10, 10] 1 x [2, 7, 7, 7, 7, 7, 7, 10, 10] 1 x [1, 1, 1, 3, 4, 7, 8, 9] 2 x [1, 2, 2, 6, 8, 8, 9, 9, 9] 1 x [1, 1, 1, 1, 4, 6, 6, 6]