Build (method = -2) #dp: 11103 Step-3' Graph: 437 vertices and 1622 arcs (0.06s) Step-4' Graph: 338 vertices and 1424 arcs (0.06s) #V4/#V3 = 0.77 #A4/#A3 = 0.88 Ready! (0.06s) Optimize a model with 347 rows, 1425 columns and 3613 nonzeros Presolve removed 80 rows and 159 columns Presolve time: 0.02s Presolved: 267 rows, 1266 columns, 3356 nonzeros Variable types: 0 continuous, 1266 integer (0 binary) Found heuristic solution: objective 999.0000000 Optimize a model with 267 rows, 1266 columns and 3356 nonzeros Presolved: 267 rows, 1266 columns, 3356 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.908e+03 Factor NZ : 6.990e+03 Factor Ops : 2.188e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.55449051e+03 -2.07300077e+05 2.04e+05 2.22e-16 5.39e+02 0s 1 2.75231750e+03 -1.02184553e+05 3.89e+04 6.66e-16 1.14e+02 0s 2 1.55008912e+03 -4.17235515e+04 1.06e+04 1.33e-15 3.33e+01 0s 3 1.05531330e+03 -1.05072947e+04 9.74e+02 6.44e-15 5.73e+00 0s 4 9.92886557e+02 -1.98155973e+03 8.77e+00 1.67e-15 1.18e+00 0s 5 6.73350627e+02 -2.01605488e+03 2.18e-01 1.78e-15 1.06e+00 0s 6 5.80619332e+02 -9.47402071e+02 1.59e-01 1.11e-15 6.01e-01 0s 7 3.49181438e+02 -4.75082176e+02 8.84e-02 7.33e-16 3.24e-01 0s 8 2.28837580e+02 -1.42253779e+02 5.49e-02 4.40e-16 1.46e-01 0s 9 1.31554603e+02 -8.01564857e+01 2.88e-02 4.08e-16 8.33e-02 0s 10 1.29562487e+02 -2.57711121e+01 2.55e-02 5.99e-16 6.11e-02 0s 11 1.10040970e+02 4.63256786e+01 1.61e-02 4.56e-16 2.51e-02 0s 12 1.00868514e+02 7.62123148e+01 9.61e-03 4.71e-16 9.71e-03 0s 13 9.53410938e+01 8.88118368e+01 4.33e-03 5.04e-16 2.57e-03 0s 14 9.09998353e+01 9.07292787e+01 1.06e-04 4.74e-16 1.06e-04 0s 15 9.09090931e+01 9.09090877e+01 2.69e-09 4.21e-16 2.14e-09 0s 16 9.09090909e+01 9.09090909e+01 5.59e-12 6.80e-16 2.14e-12 0s Barrier solved model in 16 iterations and 0.02 seconds Optimal objective 9.09090909e+01 Root relaxation: objective 9.090909e+01, 740 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 90.90909 0 44 999.00000 90.90909 90.9% - 0s H 0 0 92.0000000 90.90909 1.19% - 0s H 0 0 91.0000000 90.90909 0.10% - 0s Explored 0 nodes (1549 simplex iterations) in 0.17 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.100000000000e+01, best bound 9.100000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.17 seconds Total run time: 0.24 seconds Objective: 91 Solution: 1 x [1, 1, 3, 3, 3, 3, 4, 6, 7, 8, 9] 2 x [2, 3, 3, 3, 4, 4, 5, 6, 7, 8, 9] 11 x [2, 3, 3, 3, 4, 5, 5, 6, 7, 8, 9] 30 x [1, 1, 1, 1, 2, 3, 3, 3, 4, 6, 7] 1 x [3, 3, 3, 3, 4, 4, 5, 6, 7, 9] 21 x [1, 2, 5, 5, 6, 6, 7, 8, 8, 8, 8] 15 x [1, 2, 6, 6, 6, 7, 8, 9, 9, 9, 9] 5 x [1, 2, 4, 4, 4, 5, 5, 5, 6, 7, 7] 5 x [1, 1, 2, 2, 5, 5, 6, 6, 6, 8, 8]