Build (method = -2) #dp: 5685 Step-3' Graph: 132 vertices and 2087 arcs (0.03s) Step-4' Graph: 95 vertices and 2013 arcs (0.03s) #V4/#V3 = 0.72 #A4/#A3 = 0.96 Ready! (0.03s) Optimize a model with 182 rows, 2014 columns and 5859 nonzeros Presolve removed 8 rows and 18 columns Presolve time: 0.04s Presolved: 174 rows, 1996 columns, 5437 nonzeros Variable types: 0 continuous, 1996 integer (1565 binary) Found heuristic solution: objective 95.0000000 Optimize a model with 174 rows, 1996 columns and 5437 nonzeros Presolved: 174 rows, 1996 columns, 5437 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.949e+03 Factor NZ : 5.940e+03 Factor Ops : 2.873e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.31092867e+03 -1.06146728e+04 1.45e+04 3.01e-01 1.64e+01 0s 1 8.42099128e+02 -1.80105591e+03 2.60e+03 1.44e-15 2.82e+00 0s 2 1.62359168e+02 -4.94108198e+02 2.56e+02 8.88e-16 3.60e-01 0s 3 6.90378800e+01 -5.03768030e+01 1.96e+01 9.44e-16 4.23e-02 0s 4 5.09890951e+01 7.81808780e+00 5.82e+00 1.11e-15 1.34e-02 0s 5 4.50109084e+01 2.87141189e+01 1.33e+00 1.33e-15 4.42e-03 0s 6 4.23250083e+01 3.64511089e+01 4.29e-01 1.21e-15 1.54e-03 0s 7 4.14811705e+01 3.82006902e+01 2.41e-01 1.11e-15 8.55e-04 0s 8 4.04001604e+01 3.92931828e+01 3.81e-02 1.15e-15 2.81e-04 0s 9 4.02549646e+01 3.97832399e+01 2.18e-02 1.11e-15 1.20e-04 0s 10 4.01280887e+01 3.98412372e+01 1.04e-02 1.30e-15 7.27e-05 0s 11 4.00990553e+01 3.99273874e+01 7.85e-03 1.24e-15 4.37e-05 0s 12 4.00400063e+01 3.99751898e+01 2.95e-03 1.23e-15 1.65e-05 0s 13 4.00019564e+01 3.99975198e+01 1.31e-05 1.08e-15 1.11e-06 0s 14 4.00000147e+01 3.99999866e+01 7.99e-14 1.18e-15 7.01e-09 0s 15 4.00000000e+01 4.00000000e+01 5.83e-14 1.27e-15 9.25e-15 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 288 iterations, 0.03 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% - 0s Explored 0 nodes (526 simplex iterations) in 0.12 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.05 seconds Gurobi run time: 0.12 seconds Total run time: 0.17 seconds Objective: 40 Solution: 1 x [1, 4, 87] 1 x [1, 5, 86] 1 x [1, 8, 85] 2 x [3, 9, 84] 1 x [3, 12, 83] 1 x [5, 11, 82] 1 x [9, 17, 81] 1 x [5, 22, 80] 1 x [4, 25, 79] 1 x [3, 27, 78] 1 x [10, 29, 77] 1 x [22, 23, 77] 1 x [15, 26, 76] 1 x [14, 28, 75] 1 x [5, 34, 74] 1 x [7, 33, 74] 1 x [13, 30, 73] 1 x [1, 38, 72] 1 x [11, 35, 71] 1 x [21, 30, 70] 1 x [18, 32, 69] 1 x [22, 31, 68] 1 x [15, 37, 67] 1 x [21, 36, 66] 1 x [11, 41, 65] 1 x [6, 46, 64] 1 x [17, 39, 63] 1 x [17, 42, 62] 1 x [2, 51, 61] 1 x [20, 45, 60] 1 x [32, 33, 59] 1 x [20, 48, 58] 1 x [4, 54, 57] 1 x [19, 49, 57] 1 x [16, 50, 56] 1 x [24, 47, 55] 1 x [22, 49, 54] 1 x [19, 52, 53] 1 x [40, 43, 44]