Build (method = -2) #dp: 176507 Step-3' Graph: 842 vertices and 13062 arcs (1.65s) Step-4' Graph: 505 vertices and 12398 arcs (1.66s) #V4/#V3 = 0.60 #A4/#A3 = 0.95 Ready! (1.66s) Optimize a model with 641 rows, 12399 columns and 36181 nonzeros Presolve removed 17 rows and 25 columns Presolve time: 0.18s Presolved: 624 rows, 12374 columns, 36181 nonzeros Variable types: 0 continuous, 12374 integer (7175 binary) Found heuristic solution: objective 103.0000000 Optimize a model with 624 rows, 12374 columns and 36181 nonzeros Presolved: 624 rows, 12374 columns, 36181 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 2.554e+04 Factor NZ : 5.922e+04 (roughly 6 MBytes of memory) Factor Ops : 8.581e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.62351567e+04 -4.01321584e+05 2.32e+05 2.22e-01 1.56e+02 0s 1 1.21101405e+04 -4.61852636e+04 4.79e+04 1.33e-15 3.02e+01 0s 2 2.17036269e+03 -1.36125061e+04 5.60e+03 1.55e-15 3.84e+00 0s 3 6.45854539e+02 -6.62711729e+03 4.44e+02 1.33e-15 5.20e-01 0s 4 3.21730760e+02 -1.12040857e+03 8.32e+01 1.67e-15 9.44e-02 0s 5 1.68284498e+02 -4.14750786e+02 2.42e+01 8.88e-16 3.28e-02 0s 6 1.30312041e+02 -2.17519853e+02 1.59e+01 9.44e-16 1.94e-02 0s 7 7.38093951e+01 -1.26164670e+02 5.12e+00 9.07e-16 9.61e-03 0s 8 6.56736591e+01 -7.81488719e+01 4.10e+00 7.90e-16 6.89e-03 0s 9 5.13557668e+01 -3.00776230e+01 2.41e+00 1.47e-15 3.81e-03 0s 10 4.43969753e+01 1.46935124e+01 1.05e+00 1.33e-15 1.33e-03 0s 11 4.32775992e+01 2.27182356e+01 8.05e-01 9.29e-16 9.04e-04 0s 12 4.12522014e+01 3.47787986e+01 2.37e-01 1.25e-15 2.70e-04 0s 13 4.00429598e+01 3.97222109e+01 2.10e-03 7.77e-16 1.30e-05 0s 14 4.00000367e+01 3.99989564e+01 2.22e-07 8.88e-16 4.36e-08 0s 15 4.00000000e+01 3.99999990e+01 7.29e-12 8.88e-16 4.36e-11 0s 16 4.00000000e+01 4.00000000e+01 3.71e-12 1.32e-15 4.36e-14 0s Barrier solved model in 16 iterations and 0.23 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 10994 iterations, 0.36 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.00000 0 68 103.00000 40.00000 61.2% - 1s H 0 0 42.0000000 40.00000 4.76% - 1s H 0 0 40.0000000 40.00000 0.0% - 1s Explored 0 nodes (13024 simplex iterations) in 1.57 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: 1.70 seconds Gurobi run time: 1.57 seconds Total run time: 3.27 seconds Objective: 40 Solution: 2 x [24, 39, 51, 96, 136] 1 x [38, 84, 116, 130, 135] 1 x [11, 94, 111, 135, 135] 1 x [18, 67, 91, 129, 134] 2 x [30, 45, 79, 90, 133] 1 x [27, 97, 100, 123, 132] 1 x [1, 121, 124, 127, 131] 2 x [31, 38, 76, 90, 131] 1 x [48, 70, 80, 109, 128] 1 x [50, 70, 114, 125, 126] 1 x [13, 46, 78, 115, 123] 2 x [23, 69, 77, 100, 123] 1 x [8, 37, 93, 117, 122] 1 x [36, 103, 113, 114, 122] 1 x [12, 42, 93, 108, 120] 1 x [47, 94, 99, 107, 119] 1 x [10, 22, 41, 105, 118] 1 x [55, 103, 104, 108, 112] 1 x [43, 49, 75, 89, 110] 1 x [15, 54, 78, 106, 108] 1 x [19, 73, 87, 102, 104] 1 x [43, 52, 63, 63, 101] 1 x [2, 70, 78, 94, 99] 1 x [16, 53, 57, 88, 98] 1 x [3, 17, 56, 81, 97] 1 x [7, 22, 35, 61, 95] 1 x [28, 64, 82, 87, 92] 2 x [14, 26, 40, 59, 91] 1 x [29, 68, 82, 87, 90] 1 x [21, 58, 58, 62, 86] 1 x [18, 60, 65, 72, 85] 1 x [34, 71, 74, 82, 83] 1 x [6, 32, 33, 61, 66] 1 x [4, 9, 20, 44, 56] 1 x [5, 9, 25, 32, 44]