Build (method = -2) #dp: 30311 Step-3' Graph: 2969 vertices and 9565 arcs (0.44s) Step-4' Graph: 653 vertices and 4933 arcs (0.46s) #V4/#V3 = 0.22 #A4/#A3 = 0.52 Ready! (0.46s) Optimize a model with 773 rows, 4934 columns and 13500 nonzeros Presolve removed 91 rows and 91 columns Presolve time: 0.04s Presolved: 682 rows, 4843 columns, 13394 nonzeros Variable types: 0 continuous, 4843 integer (3777 binary) Found heuristic solution: objective 105.0000000 Optimize a model with 682 rows, 4843 columns and 13394 nonzeros Presolved: 682 rows, 4843 columns, 13394 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 7.302e+03 Factor NZ : 2.914e+04 (roughly 2 MBytes of memory) Factor Ops : 2.263e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.36423980e+04 -3.20753276e+04 1.07e+05 3.37e-01 3.89e+01 0s 1 2.49720168e+03 -1.21497085e+04 1.75e+04 7.77e-16 6.81e+00 0s 2 4.88012883e+02 -3.25461163e+03 1.47e+03 6.66e-16 7.79e-01 0s 3 1.63044811e+02 -5.59440720e+02 3.02e+02 5.00e-16 1.52e-01 0s 4 8.54018951e+01 -1.30885776e+02 8.39e+01 5.55e-16 4.41e-02 0s 5 6.09795737e+01 -1.13529901e+01 2.26e+01 6.66e-16 1.19e-02 0s 6 5.41103605e+01 1.81553467e+01 9.50e+00 2.81e-16 4.95e-03 0s 7 4.81545234e+01 3.35136460e+01 2.16e+00 4.44e-16 1.70e-03 0s 8 4.62961424e+01 3.42356003e+01 1.34e+00 3.28e-16 1.36e-03 0s 9 4.39251824e+01 3.68505411e+01 5.14e-01 3.04e-16 7.71e-04 0s 10 4.29711704e+01 3.87091214e+01 2.18e-01 4.44e-16 4.57e-04 0s 11 4.28733835e+01 4.02795756e+01 1.84e-01 4.44e-16 2.83e-04 0s 12 4.26076788e+01 4.11907782e+01 3.53e-02 2.82e-16 1.49e-04 0s 13 4.25390136e+01 4.17222516e+01 1.27e-02 3.18e-16 8.55e-05 0s 14 4.25018870e+01 4.24961792e+01 3.07e-04 4.44e-16 6.18e-07 0s 15 4.25000021e+01 4.24999962e+01 3.83e-13 4.44e-16 6.15e-10 0s 16 4.25000000e+01 4.25000000e+01 7.71e-13 4.44e-16 6.51e-16 0s Barrier solved model in 16 iterations and 0.09 seconds Optimal objective 4.25000000e+01 Root relaxation: objective 4.250000e+01, 2464 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 42.50000 0 45 105.00000 42.50000 59.5% - 0s H 0 0 43.0000000 42.50000 1.16% - 0s Explored 0 nodes (3727 simplex iterations) in 0.36 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.300000000000e+01, best bound 4.300000000000e+01, gap 0.0% Preprocessing time: 0.48 seconds Gurobi run time: 0.36 seconds Total run time: 0.84 seconds Objective: 43 Solution: 1 x [40, 56] 1 x [61, 105] 1 x [64, 81, 90] 1 x [4, 51, 87] 1 x [5, 13, 62] 1 x [30, 33, 97] 1 x [10, 50, 74] 1 x [15, 27, 115] 1 x [79, 82] 1 x [112, 118] 1 x [89, 100] 1 x [6, 54, 72] 1 x [11, 49, 101] 1 x [21, 31, 110] 1 x [19, 71, 80] 1 x [66, 95, 99] 1 x [67, 69, 113] 1 x [85, 109] 1 x [88, 103] 1 x [47, 58, 104] 1 x [3, 77] 1 x [12, 52, 65] 1 x [94, 107, 119] 1 x [2, 8, 78] 1 x [1, 17, 83] 1 x [28, 34] 1 x [22, 53, 59] 1 x [26, 55, 114] 1 x [20, 37, 96] 1 x [16, 63, 68] 1 x [18, 41, 43] 1 x [48, 75, 86] 1 x [7, 32, 120] 1 x [44, 46, 98] 1 x [57, 60, 108] 1 x [9, 25, 92] 1 x [23, 29, 111] 1 x [24, 45, 102] 1 x [14, 76, 117] 1 x [35, 38, 70] 1 x [36, 42, 91] 1 x [93, 106, 116] 1 x [39, 73, 84]