Build (method = -2) #dp: 5934 Step-3' Graph: 457 vertices and 1670 arcs (0.03s) Step-4' Graph: 389 vertices and 1534 arcs (0.03s) #V4/#V3 = 0.85 #A4/#A3 = 0.92 Ready! (0.03s) Optimize a model with 399 rows, 1535 columns and 3831 nonzeros Presolve removed 122 rows and 237 columns Presolve time: 0.02s Presolved: 277 rows, 1298 columns, 3442 nonzeros Variable types: 0 continuous, 1298 integer (0 binary) Found heuristic solution: objective 100.0000000 Optimize a model with 277 rows, 1298 columns and 3442 nonzeros Presolved: 277 rows, 1298 columns, 3442 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.994e+03 Factor NZ : 7.899e+03 Factor Ops : 3.053e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.17076182e+03 -3.26316615e+04 2.87e+04 2.22e-16 1.19e+02 0s 1 2.98605105e+02 -1.85654491e+04 3.98e+03 8.88e-16 2.05e+01 0s 2 1.55969145e+02 -7.06036769e+03 8.99e+02 1.55e-15 5.20e+00 0s 3 1.09851341e+02 -2.44476529e+03 1.40e+02 1.78e-15 1.31e+00 0s 4 1.00120609e+02 -3.95594045e+02 8.33e+00 7.11e-15 2.01e-01 0s 5 9.76816522e+01 -1.84183800e+02 1.05e-02 3.89e-15 1.08e-01 0s 6 8.00054157e+01 -1.73494408e+02 7.31e-03 3.55e-15 9.73e-02 0s 7 6.06002526e+01 -1.02960421e+02 2.21e-03 1.89e-15 6.28e-02 0s 8 4.56701861e+01 -6.04017225e+01 1.54e-03 1.11e-15 4.07e-02 0s 9 2.13565761e+01 -2.21760138e+01 4.78e-04 3.33e-16 1.67e-02 0s 10 1.92366420e+01 -6.98332976e+00 4.00e-04 3.33e-16 1.01e-02 0s 11 1.47137953e+01 8.51901870e-01 2.04e-04 2.44e-16 5.32e-03 0s 12 1.32693479e+01 4.75484887e+00 1.40e-04 2.33e-16 3.27e-03 0s 13 1.21673213e+01 7.64374860e+00 8.18e-05 2.01e-16 1.74e-03 0s 14 1.13244194e+01 9.94237482e+00 1.51e-05 2.22e-16 5.31e-04 0s 15 1.11444244e+01 1.02695899e+01 1.05e-05 2.61e-16 3.36e-04 0s 16 1.10163050e+01 1.05314418e+01 7.04e-06 1.66e-16 1.86e-04 0s 17 1.07953183e+01 1.06614852e+01 1.27e-06 2.36e-16 5.14e-05 0s 18 1.07572076e+01 1.06896286e+01 4.75e-07 2.72e-16 2.59e-05 0s 19 1.07457440e+01 1.07078481e+01 2.66e-07 2.22e-16 1.45e-05 0s 20 1.07345516e+01 1.07175034e+01 9.10e-08 2.47e-16 6.54e-06 0s 21 1.07314225e+01 1.07213494e+01 4.52e-08 1.93e-16 3.87e-06 0s 22 1.07285391e+01 1.07269442e+01 5.57e-09 1.68e-16 6.12e-07 0s 23 1.07280037e+01 1.07279922e+01 3.62e-13 2.46e-16 4.41e-09 0s 24 1.07280000e+01 1.07280000e+01 5.89e-13 2.69e-16 4.41e-12 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.07280000e+01 Root relaxation: objective 1.072800e+01, 200 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.72800 0 47 100.00000 10.72800 89.3% - 0s H 0 0 12.0000000 10.72800 10.6% - 0s H 0 0 11.0000000 10.72800 2.47% - 0s Explored 0 nodes (342 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.10 seconds Total run time: 0.15 seconds Objective: 11 Solution: 1 x [1, 3, 4, 7, 8, 8, 9, 10, 10] 3 x [1, 6, 6, 8, 8, 9, 9, 9, 10, 10] 1 x [3, 4, 5, 6, 8, 10, 10] 2 x [2, 2, 2, 2, 2, 3, 9, 10, 10] 1 x [2, 2, 3, 4, 4, 9, 9, 10, 10, 10] 1 x [1, 1, 4, 6, 7, 7, 8, 8, 9] 2 x [1, 1, 1, 1, 2, 3, 4, 8, 8]