Build (method = -2) #dp: 9624 Step-3' Graph: 562 vertices and 2873 arcs (0.05s) Step-4' Graph: 558 vertices and 2865 arcs (0.05s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.05s) Optimize a model with 568 rows, 2866 columns and 7530 nonzeros Presolve removed 27 rows and 49 columns Presolve time: 0.03s Presolved: 541 rows, 2817 columns, 7452 nonzeros Variable types: 0 continuous, 2817 integer (0 binary) Found heuristic solution: objective 805.0000000 Found heuristic solution: objective 803.0000000 Optimize a model with 541 rows, 2817 columns and 7452 nonzeros Presolved: 541 rows, 2817 columns, 7452 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.591e+03 Factor NZ : 2.368e+04 (roughly 2 MBytes of memory) Factor Ops : 1.781e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.50417387e+03 -5.91919454e+05 3.60e+05 2.22e-16 7.15e+02 0s 1 1.57415218e+03 -4.50261315e+05 5.22e+04 5.55e-16 1.63e+02 0s 2 1.41780594e+03 -1.56291667e+05 2.13e+04 1.11e-15 5.38e+01 0s 3 1.08743624e+03 -4.22761660e+04 3.97e+03 9.77e-15 1.16e+01 0s 4 1.00571622e+03 -1.02685560e+04 4.79e+02 2.22e-15 2.34e+00 0s 5 9.88752232e+02 -2.02547559e+03 2.24e+00 1.26e-15 5.35e-01 0s 6 9.26898320e+02 -1.40068313e+03 1.91e-03 7.29e-16 4.13e-01 0s 7 6.80239674e+02 -1.14682177e+03 1.01e-03 7.72e-16 3.24e-01 0s 8 5.12654764e+02 -6.16515802e+02 7.04e-04 5.88e-16 2.00e-01 0s 9 3.35529301e+02 -3.36982159e+02 4.48e-04 3.59e-16 1.19e-01 0s 10 2.44787086e+02 -1.74276601e+02 2.94e-04 3.67e-16 7.43e-02 0s 11 1.77972075e+02 -1.04858189e+02 1.74e-04 3.45e-16 5.01e-02 0s 12 1.39662832e+02 -2.47907636e+01 1.04e-04 2.81e-16 2.91e-02 0s 13 1.13619785e+02 1.40711547e+01 5.68e-05 3.22e-16 1.76e-02 0s 14 1.04976522e+02 3.75185095e+01 3.61e-05 3.43e-16 1.20e-02 0s 15 1.03651919e+02 5.19706905e+01 3.14e-05 3.45e-16 9.16e-03 0s 16 9.71557161e+01 7.41090728e+01 1.42e-05 3.38e-16 4.08e-03 0s 17 1.00720616e+02 8.14344626e+01 7.99e-06 3.29e-16 3.42e-03 0s 18 9.55994442e+01 8.61943447e+01 3.75e-06 3.37e-16 1.67e-03 0s 19 9.55233207e+01 8.69566026e+01 3.67e-06 3.33e-16 1.52e-03 0s 20 9.33986939e+01 8.94830100e+01 1.39e-06 2.92e-16 6.94e-04 0s 21 9.27947086e+01 9.16737388e+01 2.33e-07 4.44e-16 1.99e-04 0s 22 9.25846127e+01 9.24411527e+01 1.15e-08 3.67e-16 2.54e-05 0s 23 9.25487676e+01 9.25212518e+01 5.76e-13 2.23e-16 4.88e-06 0s 24 9.25450713e+01 9.25447953e+01 7.24e-13 4.44e-16 4.89e-08 0s 25 9.25450000e+01 9.25450000e+01 8.41e-13 2.97e-16 2.65e-12 0s Barrier solved model in 25 iterations and 0.10 seconds Optimal objective 9.25450000e+01 Root relaxation: objective 9.254500e+01, 1204 iterations, 0.12 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 92.54500 0 45 803.00000 92.54500 88.5% - 0s H 0 0 94.0000000 92.54500 1.55% - 0s H 0 0 93.0000000 92.54500 0.49% - 0s Explored 0 nodes (3399 simplex iterations) in 0.40 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.300000000000e+01, best bound 9.300000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.40 seconds Total run time: 0.46 seconds Objective: 93 Solution: 1 x [2, 2, 2, 2, 2, 2, 4, 4, 4, 6, 6, 8, 8, 8, 8, 8, 8, 10] 2 x [1, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 5, 8, 8, 9] 9 x [2, 2, 4, 4, 4, 4, 5, 5, 5, 8, 8, 9] 1 x [1, 2, 2, 2, 2, 4, 4, 4, 6, 6, 7, 8, 9] 32 x [2, 2, 3, 3, 6, 6, 6, 6, 9, 9] 17 x [1, 1, 1, 1, 2, 3, 3, 5, 6, 6] 1 x [1, 1, 1, 1, 2, 4, 5, 8, 8, 8, 8] 21 x [3, 3, 3, 3, 3, 6, 6, 6, 6] 2 x [1, 2, 2, 4, 4, 4, 4, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8] 7 x [1, 2, 2, 4, 4, 4, 6, 6, 6, 7, 7, 7, 7, 8, 8]