Build (method = -2) #dp: 93421 Step-3' Graph: 680 vertices and 2299 arcs (1.00s) Step-4' Graph: 227 vertices and 1394 arcs (1.00s) #V4/#V3 = 0.33 #A4/#A3 = 0.61 Ready! (1.00s) Optimize a model with 333 rows, 1395 columns and 3735 nonzeros Presolve removed 37 rows and 71 columns Presolve time: 0.04s Presolved: 296 rows, 1324 columns, 3596 nonzeros Variable types: 0 continuous, 1324 integer (345 binary) Found heuristic solution: objective 151.0000000 Optimize a model with 296 rows, 1324 columns and 3596 nonzeros Presolved: 296 rows, 1324 columns, 3596 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.962e+03 Factor NZ : 4.207e+03 Factor Ops : 9.122e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.93867276e+04 -1.07299618e+04 3.32e+04 1.98e-01 1.13e+02 0s 1 3.87619054e+03 -4.15568475e+03 5.34e+03 6.66e-16 1.87e+01 0s 2 5.37312308e+02 -1.86967423e+03 5.51e+02 6.66e-16 2.41e+00 0s 3 1.75341713e+02 -6.40074609e+02 5.62e+01 8.88e-16 4.01e-01 0s 4 1.05359654e+02 -1.00343409e+02 1.13e+01 3.89e-16 8.46e-02 0s 5 6.44620457e+01 -2.27497471e+01 4.28e+00 3.33e-16 3.44e-02 0s 6 4.63142668e+01 1.11490305e+01 1.87e+00 2.58e-16 1.36e-02 0s 7 4.30186316e+01 2.77005063e+01 9.24e-01 3.33e-16 5.82e-03 0s 8 4.03914346e+01 3.89468907e+01 1.22e-03 2.82e-16 5.34e-04 0s 9 4.00066655e+01 3.99797512e+01 4.24e-05 3.04e-16 9.94e-06 0s 10 4.00000067e+01 3.99999798e+01 3.36e-13 3.83e-16 9.94e-09 0s 11 4.00000000e+01 4.00000000e+01 1.31e-13 2.93e-16 1.01e-14 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 875 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.00000 0 22 151.00000 40.00000 73.5% - 0s H 0 0 41.0000000 40.00000 2.44% - 0s H 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (1065 simplex iterations) in 0.10 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.01 seconds Gurobi run time: 0.10 seconds Total run time: 1.12 seconds Objective: 40 Solution: 1 x [6, 6, 87, 92, 106] 1 x [34, 34, 41, 79, 105] 1 x [37, 70, 77, 105, 105] 1 x [2, 4, 96, 97, 104] 1 x [5, 96, 101, 104, 104] 1 x [4, 90, 99, 101, 103] 1 x [18, 44, 49, 50, 103] 1 x [13, 96, 100, 101, 102] 1 x [8, 29, 58, 95, 102] 1 x [13, 98, 101, 102, 102] 1 x [1, 86, 94, 95, 98] 1 x [1, 86, 87, 93, 95] 1 x [5, 17, 61, 84, 91] 1 x [4, 7, 84, 86, 90] 2 x [30, 31, 32, 76, 89] 1 x [27, 66, 71, 75, 88] 1 x [5, 22, 61, 63, 85] 1 x [8, 23, 58, 63, 85] 2 x [27, 43, 68, 68, 83] 2 x [3, 11, 64, 78, 82] 1 x [13, 36, 51, 58, 81] 1 x [18, 39, 49, 51, 80] 1 x [18, 40, 49, 50, 76] 1 x [21, 52, 65, 67, 74] 2 x [14, 16, 25, 37, 73] 2 x [11, 12, 28, 62, 72] 1 x [20, 21, 48, 66, 69] 3 x [33, 35, 41, 55, 66] 1 x [21, 38, 47, 59, 60] 1 x [19, 24, 38, 45, 57] 1 x [11, 19, 38, 42, 56] 1 x [10, 19, 26, 46, 54] 1 x [9, 15, 19, 46, 53]