Build (method = -2) #dp: 4250 Step-3' Graph: 107 vertices and 1824 arcs (0.01s) Step-4' Graph: 106 vertices and 1822 arcs (0.02s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 170 rows, 1823 columns and 5264 nonzeros Presolve removed 32 rows and 32 columns Presolve time: 0.03s Presolved: 138 rows, 1791 columns, 5210 nonzeros Variable types: 0 continuous, 1791 integer (972 binary) Found heuristic solution: objective 69.0000000 Optimize a model with 138 rows, 1791 columns and 5210 nonzeros Presolved: 138 rows, 1791 columns, 5210 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.900e+03 Factor NZ : 6.480e+03 Factor Ops : 4.151e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.45732923e+03 -7.19169779e+03 4.35e+03 1.68e-01 2.67e+01 0s 1 9.81389300e+02 -2.99179039e+03 7.50e+02 5.55e-16 4.95e+00 0s 2 2.27034994e+02 -1.29230591e+03 6.81e+01 5.55e-16 7.37e-01 0s 3 9.71224640e+01 -1.12762407e+02 4.04e+00 4.16e-16 7.03e-02 0s 4 6.75470924e+01 -1.34027028e+01 1.15e+00 3.28e-16 2.46e-02 0s 5 5.45213023e+01 1.68891628e+01 5.12e-01 1.69e-16 1.10e-02 0s 6 5.06937155e+01 2.78853900e+01 3.53e-01 3.33e-16 6.64e-03 0s 7 4.54977320e+01 3.31943086e+01 1.70e-01 2.22e-16 3.54e-03 0s 8 4.26031678e+01 3.55471849e+01 8.22e-02 2.14e-16 2.02e-03 0s 9 4.19065653e+01 3.70850438e+01 6.27e-02 1.71e-16 1.38e-03 0s 10 4.12296194e+01 3.85065310e+01 3.58e-02 2.22e-16 7.75e-04 0s 11 4.03745471e+01 3.92354995e+01 1.30e-02 2.22e-16 3.22e-04 0s 12 4.00322739e+01 3.94394047e+01 5.08e-03 2.22e-16 1.67e-04 0s 13 3.98710588e+01 3.95755051e+01 2.23e-03 2.44e-16 8.31e-05 0s 14 3.97619166e+01 3.96639866e+01 3.98e-04 1.48e-16 2.74e-05 0s 15 3.97502808e+01 3.97470864e+01 2.87e-05 2.95e-16 9.08e-07 0s 16 3.97500004e+01 3.97499971e+01 4.88e-12 3.33e-16 9.09e-10 0s 17 3.97500000e+01 3.97500000e+01 2.01e-12 2.61e-16 9.12e-16 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 3.97500000e+01 Root relaxation: objective 3.975000e+01, 669 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 39.75000 0 19 69.00000 39.75000 42.4% - 0s H 0 0 41.0000000 39.75000 3.05% - 0s H 0 0 40.0000000 39.75000 0.62% - 0s Explored 0 nodes (1590 simplex iterations) in 0.14 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.14 seconds Total run time: 0.16 seconds Objective: 40 Solution: 1 x [15, 64] 1 x [5, 9, 64] 1 x [16, 63] 1 x [19, 62] 1 x [11, 61] 1 x [20, 60] 2 x [8, 13, 59] 1 x [4, 6, 10, 59] 1 x [21, 58] 1 x [10, 12, 58] 1 x [22, 57] 1 x [5, 19, 57] 1 x [9, 14, 57] 1 x [23, 56] 1 x [25, 55] 1 x [27, 54] 1 x [26, 54] 1 x [3, 24, 54] 1 x [1, 1, 27, 53] 1 x [28, 52] 1 x [31, 51] 1 x [30, 51] 1 x [1, 1, 29, 51] 1 x [7, 24, 51] 1 x [33, 50] 1 x [34, 49] 1 x [35, 48] 1 x [36, 47] 1 x [37, 46] 1 x [38, 45] 1 x [37, 45] 1 x [2, 39, 44] 1 x [38, 44] 1 x [41, 43] 1 x [10, 33, 42] 1 x [23, 23, 40] 1 x [18, 32, 39] 1 x [9, 25, 39] 1 x [17, 35, 36]