Build (method = -2) #dp: 166913 Step-3' Graph: 841 vertices and 14280 arcs (1.74s) Step-4' Graph: 523 vertices and 13653 arcs (1.75s) #V4/#V3 = 0.62 #A4/#A3 = 0.96 Ready! (1.75s) Optimize a model with 659 rows, 13654 columns and 39911 nonzeros Presolve removed 21 rows and 37 columns Presolve time: 0.23s Presolved: 638 rows, 13617 columns, 39880 nonzeros Variable types: 0 continuous, 13617 integer (7577 binary) Found heuristic solution: objective 115.0000000 Found heuristic solution: objective 111.0000000 Optimize a model with 638 rows, 13617 columns and 39880 nonzeros Presolved: 638 rows, 13617 columns, 39880 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 2.738e+04 Factor NZ : 6.564e+04 (roughly 6 MBytes of memory) Factor Ops : 1.029e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.24484120e+04 -3.34771020e+05 2.66e+05 2.19e-01 1.50e+02 0s 1 1.02638430e+04 -4.05850566e+04 4.99e+04 8.88e-16 2.70e+01 0s 2 1.39938331e+03 -1.32771540e+04 3.49e+03 5.55e-15 2.26e+00 0s 3 5.10676485e+02 -6.02937343e+03 3.93e+02 3.33e-15 4.11e-01 0s 4 2.89856360e+02 -1.37943681e+03 7.31e+01 7.77e-16 8.73e-02 0s 5 1.68182265e+02 -5.37821353e+02 2.41e+01 8.88e-16 3.35e-02 0s 6 1.05399584e+02 -2.56426227e+02 9.91e+00 5.97e-16 1.59e-02 0s 7 6.04773633e+01 -1.71676826e+02 2.98e+00 6.66e-16 9.23e-03 0s 8 4.76442380e+01 -7.20428385e+01 1.34e+00 4.44e-16 4.63e-03 0s 9 4.57526291e+01 -1.67454857e+01 1.03e+00 6.05e-16 2.43e-03 0s 10 4.31154391e+01 -1.49359531e+01 7.60e-01 4.75e-16 2.23e-03 0s 11 4.22560251e+01 5.00229551e+00 5.36e-01 4.94e-16 1.42e-03 0s 12 4.13803536e+01 2.41995684e+01 1.54e-01 3.61e-16 6.38e-04 0s 13 4.01602923e+01 3.54561634e+01 1.06e-02 3.35e-16 1.73e-04 0s 14 4.00046032e+01 3.99816210e+01 2.07e-12 3.33e-16 8.42e-07 0s 15 4.00000046e+01 3.99999816e+01 2.73e-12 3.33e-16 8.42e-10 0s 16 4.00000000e+01 4.00000000e+01 2.65e-12 3.33e-16 8.67e-16 0s Barrier solved model in 16 iterations and 0.26 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 12148 iterations, 0.41 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 1s Explored 0 nodes (13875 simplex iterations) in 1.42 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.81 seconds Gurobi run time: 1.42 seconds Total run time: 3.23 seconds Objective: 40 Solution: 1 x [45, 64, 69, 114, 136] 1 x [9, 111, 112, 132, 135] 1 x [14, 18, 72, 91, 134] 1 x [39, 53, 70, 73, 134] 1 x [13, 80, 92, 128, 133] 1 x [32, 43, 66, 130, 131] 1 x [11, 60, 86, 124, 129] 1 x [5, 60, 84, 109, 129] 1 x [50, 107, 108, 110, 127] 1 x [28, 85, 100, 102, 127] 1 x [5, 91, 97, 99, 127] 1 x [12, 17, 33, 85, 126] 1 x [3, 33, 98, 115, 125] 1 x [22, 23, 95, 104, 125] 2 x [8, 30, 71, 78, 123] 1 x [1, 105, 119, 120, 122] 1 x [35, 54, 79, 87, 121] 1 x [29, 48, 77, 88, 119] 1 x [2, 61, 108, 116, 118] 1 x [48, 69, 83, 94, 118] 1 x [16, 30, 39, 66, 117] 1 x [4, 80, 80, 104, 116] 2 x [10, 47, 65, 75, 115] 1 x [24, 49, 61, 63, 115] 1 x [35, 55, 55, 76, 113] 1 x [19, 20, 29, 82, 106] 1 x [35, 57, 74, 79, 106] 1 x [31, 38, 42, 96, 103] 1 x [25, 36, 64, 98, 102] 1 x [27, 41, 74, 99, 101] 1 x [34, 44, 75, 93, 94] 2 x [6, 7, 15, 21, 90] 1 x [39, 68, 73, 81, 89] 1 x [24, 26, 37, 59, 76] 1 x [40, 51, 51, 62, 67] 1 x [11, 35, 46, 53, 58] 1 x [45, 52, 56, 56, 56]