Build (method = -2) #dp: 480960 Step-3' Graph: 1033 vertices and 6433 arcs (6.54s) Step-4' Graph: 665 vertices and 5697 arcs (6.54s) #V4/#V3 = 0.64 #A4/#A3 = 0.89 Ready! (6.54s) Optimize a model with 711 rows, 5698 columns and 15772 nonzeros Presolve removed 112 rows and 227 columns Presolve time: 0.09s Presolved: 599 rows, 5471 columns, 15675 nonzeros Variable types: 0 continuous, 5471 integer (1609 binary) Found heuristic solution: objective 140.0000000 Found heuristic solution: objective 130.0000000 Optimize a model with 599 rows, 5471 columns and 15675 nonzeros Presolved: 599 rows, 5471 columns, 15675 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 9.277e+03 Factor NZ : 2.636e+04 (roughly 3 MBytes of memory) Factor Ops : 1.725e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.01237343e+03 -7.84748449e+04 9.75e+04 1.76e-01 9.16e+01 0s 1 1.52570494e+03 -2.06252922e+04 1.93e+04 8.88e-16 1.81e+01 0s 2 3.76020463e+02 -9.69279182e+03 2.84e+03 9.99e-16 3.15e+00 0s 3 1.99425318e+02 -3.67113808e+03 5.24e+02 1.11e-15 6.90e-01 0s 4 1.51561289e+02 -1.65693879e+03 1.21e+02 1.11e-15 2.31e-01 0s 5 1.11441739e+02 -6.98492467e+02 4.07e+01 8.88e-16 9.28e-02 0s 6 7.91693387e+01 -3.86470132e+02 1.71e+01 1.11e-15 4.95e-02 0s 7 6.33410657e+01 -2.32335013e+02 1.09e+01 7.08e-16 3.09e-02 0s 8 4.63313894e+01 -1.21269051e+02 4.53e+00 7.37e-16 1.67e-02 0s 9 3.41047580e+01 -1.85664071e+01 1.47e+00 6.73e-16 5.13e-03 0s 10 3.04704519e+01 3.69576775e+00 8.25e-01 7.36e-16 2.59e-03 0s 11 2.91066363e+01 1.26917371e+01 5.98e-01 6.42e-16 1.58e-03 0s 12 2.84796103e+01 1.73285602e+01 4.67e-01 7.03e-16 1.07e-03 0s 13 2.79817206e+01 2.08885806e+01 2.87e-01 6.83e-16 6.71e-04 0s 14 2.72567958e+01 2.65260938e+01 2.38e-13 6.56e-16 6.66e-05 0s 15 2.71672306e+01 2.71607507e+01 1.57e-13 5.98e-16 5.90e-07 0s 16 2.71666672e+01 2.71666608e+01 1.82e-13 6.22e-16 5.90e-10 0s 17 2.71666667e+01 2.71666667e+01 1.45e-13 7.03e-16 5.90e-13 0s Barrier solved model in 17 iterations and 0.09 seconds Optimal objective 2.71666667e+01 Root relaxation: objective 2.716667e+01, 4312 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 27.16667 0 40 130.00000 27.16667 79.1% - 0s H 0 0 28.0000000 27.16667 2.98% - 0s Explored 0 nodes (6158 simplex iterations) in 0.54 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.800000000000e+01, best bound 2.800000000000e+01, gap 0.0% Preprocessing time: 6.56 seconds Gurobi run time: 0.54 seconds Total run time: 7.10 seconds Objective: 28 Solution: 1 x [7, 14, 32, 33, 37, 46] 1 x [5, 6, 7, 10, 29, 46] 2 x [7, 10, 18, 23, 45, 46] 1 x [3, 7, 25, 25, 41, 41] 1 x [11, 22, 28, 31, 33, 42] 1 x [2, 40, 40, 43, 43] 1 x [4, 4, 7, 9, 40, 40] 1 x [2, 3, 7, 7, 28] 2 x [19, 21, 21, 30, 42, 45] 1 x [17, 19, 20, 27, 45] 1 x [17, 17, 19, 20, 27, 45] 2 x [7, 13, 18, 19, 27, 46] 1 x [16, 21, 26, 34, 45] 1 x [16, 21, 26, 34, 34, 45] 1 x [7, 15, 20, 22, 44] 1 x [7, 7, 36, 38, 39, 44] 1 x [8, 15, 15, 15, 38, 45] 1 x [1, 7, 24, 39, 39, 39] 3 x [7, 19, 33, 35, 38, 45] 4 x [7, 7, 7, 12, 19, 30]