Build (method = -2) #dp: 3522 Step-3' Graph: 83 vertices and 234 arcs (0.02s) Step-4' Graph: 11 vertices and 90 arcs (0.02s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.02s) Optimize a model with 20 rows, 91 columns and 263 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 18 rows, 89 columns, 259 nonzeros Variable types: 0 continuous, 89 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 937.0000000 Optimize a model with 18 rows, 89 columns and 259 nonzeros Presolved: 18 rows, 89 columns, 259 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.600e+01 Factor NZ : 1.710e+02 Factor Ops : 2.109e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.20236500e+03 -1.24097346e+04 2.57e+03 1.11e-16 3.36e+02 0s 1 7.81455538e+02 -5.17471373e+03 1.02e+02 5.55e-16 3.94e+01 0s 2 4.18036849e+02 -3.49734234e+02 7.53e-02 5.33e-15 4.13e+00 0s 3 2.02740285e+02 -8.27585004e+01 2.32e-02 1.22e-15 1.53e+00 0s 4 1.24749664e+02 3.27724911e+01 4.98e-03 4.44e-16 4.92e-01 0s 5 1.15744255e+02 1.02077146e+02 1.70e-03 1.52e-16 7.31e-02 0s 6 1.11288965e+02 1.10838143e+02 1.77e-06 1.41e-16 2.41e-03 0s 7 1.11111144e+02 1.11110692e+02 4.34e-09 2.22e-16 2.42e-06 0s 8 1.11111111e+02 1.11111111e+02 1.11e-13 1.49e-16 2.42e-09 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 73 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 12 937.00000 111.11111 88.1% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (84 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.03 seconds Objective: 112 Solution: 51 x [1, 2, 3, 4, 6, 6, 7, 8, 8] 10 x [1, 2, 3, 4, 5, 6, 6, 8, 8] 2 x [1, 2, 3, 4, 4, 5, 6, 6, 8] 1 x [3, 4, 4, 5, 6, 6, 6, 7, 8] 32 x [3, 3, 4, 4, 4, 4, 6, 6, 8] 15 x [1, 3, 5, 6, 6, 6, 8, 8, 9] 1 x [6]