Build (method = -2) #dp: 5946 Step-3' Graph: 1056 vertices and 3161 arcs (0.04s) Step-4' Graph: 515 vertices and 2079 arcs (0.05s) #V4/#V3 = 0.49 #A4/#A3 = 0.66 Ready! (0.05s) Optimize a model with 555 rows, 2080 columns and 5214 nonzeros Presolve removed 94 rows and 160 columns Presolve time: 0.04s Presolved: 461 rows, 1920 columns, 5143 nonzeros Variable types: 0 continuous, 1920 integer (192 binary) Found heuristic solution: objective 247.0000000 Optimize a model with 461 rows, 1920 columns and 5143 nonzeros Presolve removed 2 rows and 2 columns Presolved: 459 rows, 1918 columns, 5158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.461e+03 Factor NZ : 1.654e+04 (roughly 1 MByte of memory) Factor Ops : 9.875e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.86961569e+03 -2.59832165e+04 5.00e+04 1.02e-01 6.23e+01 0s 1 7.37420302e+02 -1.30295715e+04 9.02e+03 6.66e-16 1.26e+01 0s 2 4.16542080e+02 -4.68002792e+03 1.37e+03 6.66e-16 2.47e+00 0s 3 3.21047297e+02 -9.24432228e+02 1.48e+02 1.44e-15 4.14e-01 0s 4 2.83420417e+02 -4.36329911e+02 1.76e+01 9.99e-16 1.95e-01 0s 5 2.61420205e+02 -2.24266640e+02 8.16e+00 6.66e-16 1.29e-01 0s 6 2.40105934e+02 -7.61504480e+01 3.95e+00 6.66e-16 8.33e-02 0s 7 2.13080225e+02 2.68837522e+01 1.47e+00 4.44e-16 4.87e-02 0s 8 2.03263789e+02 5.97794746e+01 8.47e-01 3.33e-16 3.74e-02 0s 9 1.91857811e+02 1.10052311e+02 3.95e-01 4.44e-16 2.13e-02 0s 10 1.84058029e+02 1.67125638e+02 1.32e-01 2.25e-16 4.42e-03 0s 11 1.80073038e+02 1.75707877e+02 7.49e-03 3.38e-16 1.13e-03 0s 12 1.79534098e+02 1.79347371e+02 3.19e-04 3.43e-16 4.85e-05 0s 13 1.79500099e+02 1.79499742e+02 2.38e-13 4.10e-16 9.25e-08 0s 14 1.79500000e+02 1.79500000e+02 3.41e-13 2.71e-16 9.27e-14 0s Barrier solved model in 14 iterations and 0.04 seconds Optimal objective 1.79500000e+02 Root relaxation: objective 1.795000e+02, 670 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 179.50000 0 14 247.00000 179.50000 27.3% - 0s H 0 0 180.0000000 179.50000 0.28% - 0s Explored 0 nodes (967 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.800000000000e+02, best bound 1.800000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.12 seconds Total run time: 0.18 seconds Objective: 180 Solution: 8 x [1, 29] 6 x [1, 31] 1 x [1, 36, 40] 1 x [1, 40] 7 x [2] 5 x [2, 29] 4 x [3, 27] 2 x [3, 33] 6 x [4, 28] 1 x [4, 34] 6 x [5, 27] 1 x [5, 35, 36, 37, 39] 3 x [5, 35, 36, 39] 7 x [6, 24] 3 x [6, 26] 3 x [6, 27] 1 x [6, 29, 40] 5 x [7, 28] 12 x [8, 25] 7 x [8, 27, 37] 1 x [8, 28] 1 x [9, 25, 40] 2 x [9, 30] 2 x [10, 23] 11 x [10, 26, 37, 39] 3 x [10, 30] 1 x [10, 30, 39] 1 x [11, 22] 3 x [11, 26] 4 x [11, 29] 4 x [11, 31] 4 x [11, 32] 8 x [12, 20] 2 x [13, 19] 6 x [13, 20] 1 x [14, 18] 3 x [14, 20] 11 x [14, 21] 1 x [15, 40] 15 x [16, 17] 2 x [16, 20] 3 x [17, 19, 38] 2 x [18, 21, 36]