Build (method = -2) #dp: 4501 Step-3' Graph: 370 vertices and 1475 arcs (0.02s) Step-4' Graph: 309 vertices and 1353 arcs (0.02s) #V4/#V3 = 0.84 #A4/#A3 = 0.92 Ready! (0.02s) Optimize a model with 319 rows, 1354 columns and 3454 nonzeros Presolve removed 85 rows and 148 columns Presolve time: 0.02s Presolved: 234 rows, 1206 columns, 3261 nonzeros Variable types: 0 continuous, 1206 integer (23 binary) Found heuristic solution: objective 103.0000000 Found heuristic solution: objective 75.0000000 Found heuristic solution: objective 69.0000000 Optimize a model with 234 rows, 1206 columns and 3261 nonzeros Presolved: 234 rows, 1206 columns, 3261 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.736e+03 Factor NZ : 5.903e+03 Factor Ops : 1.683e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.06642388e+03 -2.84465952e+04 2.35e+04 8.45e-02 8.57e+01 0s 1 3.54129752e+02 -1.36299257e+04 3.72e+03 9.99e-16 1.57e+01 0s 2 2.14985511e+02 -4.29477753e+03 9.26e+02 1.22e-15 3.72e+00 0s 3 1.68548445e+02 -1.12952688e+03 8.08e+01 4.44e-15 6.57e-01 0s 4 1.57086799e+02 -6.45490026e+02 1.47e+01 2.00e-15 3.47e-01 0s 5 1.43880342e+02 -4.67705944e+02 1.06e+01 1.78e-15 2.62e-01 0s 6 1.24896754e+02 -2.70636429e+02 6.98e+00 8.88e-16 1.68e-01 0s 7 8.80740806e+01 -1.48235951e+02 3.62e+00 4.44e-16 9.98e-02 0s 8 9.30669545e+01 -1.24088548e+02 3.25e+00 3.33e-16 9.16e-02 0s 9 6.45486752e+01 -3.95674714e+01 2.00e+00 4.06e-16 4.41e-02 0s 10 4.54788666e+01 -2.36667878e+01 1.34e+00 3.64e-16 2.92e-02 0s 11 2.36934936e+01 -4.89146333e+00 6.11e-01 3.17e-16 1.21e-02 0s 12 1.57418422e+01 -6.79236122e-02 3.16e-01 1.78e-16 6.67e-03 0s 13 1.31950847e+01 3.03716679e+00 2.03e-01 2.64e-16 4.28e-03 0s 14 1.27503031e+01 5.05751157e+00 1.41e-01 2.22e-16 3.23e-03 0s 15 1.22759686e+01 7.77610068e+00 1.04e-01 2.33e-16 1.89e-03 0s 16 1.18802752e+01 9.99194492e+00 6.49e-02 3.35e-16 7.93e-04 0s 17 1.13997016e+01 1.05424064e+01 2.41e-02 2.91e-16 3.59e-04 0s 18 1.11123805e+01 1.10828354e+01 6.33e-05 3.17e-16 1.22e-05 0s 19 1.11111112e+01 1.11111108e+01 1.25e-09 3.33e-16 1.49e-10 0s 20 1.11111111e+01 1.11111111e+01 1.01e-13 2.57e-16 1.49e-13 0s Barrier solved model in 20 iterations and 0.02 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 613 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 25 69.00000 11.11111 83.9% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (1333 simplex iterations) in 0.10 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.10 seconds Total run time: 0.14 seconds Objective: 12 Solution: 1 x [1, 2, 2, 4, 5, 6, 8] 2 x [1, 2, 2, 4, 5, 6, 8, 8, 8] 1 x [1, 2, 2, 2, 2, 3, 9, 9, 9] 1 x [1, 2, 2, 2, 2, 9, 9, 9, 9] 1 x [4, 6, 9, 9, 10, 10, 10, 10] 1 x [4, 9, 9, 10, 10, 10, 10] 3 x [4, 6, 6, 6, 6, 6, 7, 9, 9] 1 x [7, 7, 7, 7, 7, 7, 7, 7, 9] 1 x [4, 4, 4, 4, 9, 9]