Build (method = -2) #dp: 5000 Step-3' Graph: 508 vertices and 2431 arcs (0.03s) Step-4' Graph: 493 vertices and 2401 arcs (0.03s) #V4/#V3 = 0.97 #A4/#A3 = 0.99 Ready! (0.03s) Optimize a model with 503 rows, 2402 columns and 6236 nonzeros Presolve removed 65 rows and 124 columns Presolve time: 0.03s Presolved: 438 rows, 2278 columns, 6095 nonzeros Variable types: 0 continuous, 2278 integer (0 binary) Found heuristic solution: objective 70.0000000 Optimize a model with 438 rows, 2278 columns and 6095 nonzeros Presolved: 438 rows, 2278 columns, 6095 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.756e+03 Factor NZ : 2.369e+04 (roughly 1 MByte of memory) Factor Ops : 2.296e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.11178620e+02 -3.96642352e+04 3.29e+04 1.11e-16 7.35e+01 0s 1 2.09514218e+02 -2.88482050e+04 4.67e+03 8.88e-16 1.49e+01 0s 2 1.55411861e+02 -8.34318549e+03 1.28e+03 2.00e-15 3.60e+00 0s 3 1.47150390e+02 -2.07736614e+03 1.86e+02 4.44e-15 6.94e-01 0s 4 1.40202425e+02 -2.92322410e+02 3.65e-01 3.11e-15 9.50e-02 0s 5 1.22044273e+02 -2.26979393e+02 3.65e-05 2.66e-15 7.65e-02 0s 6 9.41375190e+01 -1.33752963e+02 2.42e-05 1.55e-15 4.99e-02 0s 7 6.30546822e+01 -6.05876816e+01 1.53e-05 8.33e-16 2.71e-02 0s 8 5.21614766e+01 -4.21009227e+01 1.23e-05 7.48e-16 2.07e-02 0s 9 3.91887717e+01 -2.67943771e+01 8.95e-06 8.71e-16 1.45e-02 0s 10 2.59169487e+01 -7.76923448e+00 5.55e-06 6.66e-16 7.38e-03 0s 11 2.20873652e+01 -2.17421825e+00 4.14e-06 8.98e-16 5.31e-03 0s 12 1.64625946e+01 1.46024997e+00 2.11e-06 7.85e-16 3.29e-03 0s 13 1.54325932e+01 2.49299184e+00 1.73e-06 8.82e-16 2.83e-03 0s 14 1.61939010e+01 5.53487146e+00 1.43e-06 8.80e-16 2.33e-03 0s 15 1.32247610e+01 8.71799661e+00 4.86e-07 5.76e-16 9.87e-04 0s 16 1.24108249e+01 1.04978648e+01 2.37e-07 5.68e-16 4.19e-04 0s 17 1.20792160e+01 1.12705726e+01 1.23e-07 8.52e-16 1.77e-04 0s 18 1.20421313e+01 1.13779568e+01 1.10e-07 7.32e-16 1.45e-04 0s 19 1.18809992e+01 1.14980616e+01 5.78e-08 7.07e-16 8.39e-05 0s 20 1.17977277e+01 1.15548359e+01 3.33e-08 7.49e-16 5.32e-05 0s 21 1.17265369e+01 1.16141844e+01 1.26e-08 6.10e-16 2.46e-05 0s 22 1.17055520e+01 1.16422788e+01 6.99e-09 5.97e-16 1.39e-05 0s 23 1.16937685e+01 1.16608609e+01 4.09e-09 5.46e-16 7.21e-06 0s 24 1.16865985e+01 1.16673395e+01 2.43e-09 5.85e-16 4.22e-06 0s 25 1.16796530e+01 1.16719870e+01 7.84e-10 6.73e-16 1.68e-06 0s 26 1.16761345e+01 1.16749925e+01 5.51e-12 4.70e-16 2.50e-07 0s 27 1.16760002e+01 1.16759990e+01 8.06e-13 5.55e-16 2.78e-10 0s 28 1.16760000e+01 1.16760000e+01 5.74e-13 7.51e-16 2.90e-16 0s Barrier solved model in 28 iterations and 0.10 seconds Optimal objective 1.16760000e+01 Root relaxation: objective 1.167600e+01, 687 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.67600 0 40 70.00000 11.67600 83.3% - 0s H 0 0 13.0000000 11.67600 10.2% - 0s H 0 0 12.0000000 11.67600 2.70% - 0s Explored 0 nodes (1828 simplex iterations) in 0.31 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.05 seconds Gurobi run time: 0.31 seconds Total run time: 0.36 seconds Objective: 12 Solution: 3 x [3, 4, 5, 6, 6, 6, 9, 9, 9] 1 x [2, 4, 5, 5, 7, 8, 9] 3 x [2, 2, 5, 5, 6, 7, 10] 2 x [1, 1, 1, 2, 7, 7, 7, 9, 9] 1 x [3, 4, 4, 4, 4, 4, 4, 6, 7, 10] 1 x [3, 4, 4, 4, 4, 4, 4, 6, 6, 7, 10] 1 x [1, 1, 1, 1, 7, 8]