Build (method = -2) #dp: 7661 Step-3' Graph: 557 vertices and 2159 arcs (0.04s) Step-4' Graph: 478 vertices and 2001 arcs (0.04s) #V4/#V3 = 0.86 #A4/#A3 = 0.93 Ready! (0.04s) Optimize a model with 488 rows, 2002 columns and 5064 nonzeros Presolve removed 146 rows and 280 columns Presolve time: 0.03s Presolved: 342 rows, 1722 columns, 4687 nonzeros Variable types: 0 continuous, 1722 integer (0 binary) Found heuristic solution: objective 999.0000000 Optimize a model with 342 rows, 1722 columns and 4687 nonzeros Presolved: 342 rows, 1722 columns, 4687 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.612e+03 Factor NZ : 1.089e+04 Factor Ops : 5.029e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.64325862e+03 -3.19656561e+05 2.37e+05 2.22e-16 6.15e+02 0s 1 2.45418166e+03 -1.84371533e+05 4.09e+04 7.77e-16 1.30e+02 0s 2 1.51772578e+03 -5.91930145e+04 1.14e+04 1.33e-15 3.41e+01 0s 3 1.06454684e+03 -1.53593305e+04 1.40e+03 4.00e-15 6.49e+00 0s 4 9.95656174e+02 -2.98782765e+03 2.15e+01 2.89e-15 1.17e+00 0s 5 9.43451663e+02 -1.82658317e+03 1.05e-02 1.78e-15 8.02e-01 0s 6 7.20253989e+02 -1.07581616e+03 6.55e-03 1.22e-15 5.20e-01 0s 7 5.01976689e+02 -5.35570038e+02 4.55e-03 6.66e-16 3.00e-01 0s 8 2.92243835e+02 -2.31597802e+02 2.51e-03 6.66e-16 1.52e-01 0s 9 1.55962142e+02 -4.69843445e+00 1.12e-03 5.30e-16 4.65e-02 0s 10 1.18691636e+02 2.94292471e+01 6.49e-04 4.23e-16 2.58e-02 0s 11 1.17817196e+02 5.95798823e+01 4.35e-04 4.44e-16 1.69e-02 0s 12 1.04090738e+02 7.73706235e+01 1.17e-04 4.28e-16 7.74e-03 0s 13 9.93446046e+01 8.95573607e+01 3.70e-05 3.99e-16 2.83e-03 0s 14 9.72377442e+01 9.29983228e+01 1.11e-05 4.44e-16 1.23e-03 0s 15 9.64027767e+01 9.46366766e+01 3.93e-06 3.14e-16 5.11e-04 0s 16 9.59131798e+01 9.53328887e+01 9.09e-07 3.62e-16 1.68e-04 0s 17 9.57577062e+01 9.55768371e+01 2.71e-07 3.95e-16 5.24e-05 0s 18 9.56939373e+01 9.56532725e+01 4.68e-08 2.83e-16 1.18e-05 0s 19 9.56772900e+01 9.56762535e+01 5.71e-10 3.33e-16 3.00e-07 0s 20 9.56770000e+01 9.56769999e+01 8.55e-13 2.59e-16 2.58e-11 0s Barrier solved model in 20 iterations and 0.04 seconds Optimal objective 9.56770000e+01 Root relaxation: objective 9.567700e+01, 377 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 95.67700 0 49 999.00000 95.67700 90.4% - 0s H 0 0 97.0000000 95.67700 1.36% - 0s H 0 0 96.0000000 95.67700 0.34% - 0s Explored 0 nodes (931 simplex iterations) in 0.20 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.600000000000e+01, best bound 9.600000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.20 seconds Total run time: 0.26 seconds Objective: 96 Solution: 1 x [2, 5, 6, 7, 7, 8, 8, 8] 8 x [2, 5, 6, 6, 7, 7, 7, 8, 8, 8, 8] 15 x [2, 5, 6, 6, 6, 7, 8, 9, 9, 10, 10] 1 x [2, 3, 4, 5, 7, 7, 7, 7, 8, 8, 8] 19 x [2, 4, 4, 5, 7, 7, 7, 10, 10, 10, 10] 1 x [2, 3, 3, 3, 5, 5, 6, 8, 8, 8, 8] 3 x [2, 5, 5, 5, 5, 5, 8, 10] 1 x [2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8] 1 x [2, 2, 3, 4, 6, 6, 8, 8, 8, 8] 1 x [2, 2, 2, 3, 6, 7, 8, 8, 8] 1 x [2, 2, 2, 2, 10, 10, 10, 10, 10, 10, 10] 3 x [1, 1, 5, 7, 7, 7, 7, 7, 10, 10, 10] 41 x [1, 1, 3, 3, 3, 4, 4, 7, 9, 9]