Build (method = -2) #dp: 15960 Step-3' Graph: 429 vertices and 3531 arcs (0.11s) Step-4' Graph: 191 vertices and 3055 arcs (0.11s) #V4/#V3 = 0.45 #A4/#A3 = 0.87 Ready! (0.11s) Optimize a model with 311 rows, 3056 columns and 8790 nonzeros Presolve removed 46 rows and 46 columns Presolve time: 0.03s Presolved: 265 rows, 3010 columns, 8798 nonzeros Variable types: 0 continuous, 3010 integer (2758 binary) Found heuristic solution: objective 85.0000000 Optimize a model with 265 rows, 3010 columns and 8798 nonzeros Presolved: 265 rows, 3010 columns, 8798 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.469e+03 Factor NZ : 1.150e+04 (roughly 1 MByte of memory) Factor Ops : 7.253e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.19096588e+03 -2.12995080e+04 4.45e+04 3.22e-01 2.04e+01 0s 1 1.74678523e+03 -3.47001069e+03 6.99e+03 1.33e-15 3.12e+00 0s 2 3.31302136e+02 -6.11411958e+02 8.74e+02 7.98e-16 4.31e-01 0s 3 9.90930541e+01 -7.92448723e+01 1.14e+02 9.44e-16 6.35e-02 0s 4 5.84920813e+01 2.06438243e+00 2.09e+01 1.28e-15 1.48e-02 0s 5 4.97798412e+01 2.12975184e+01 9.02e+00 8.88e-16 6.30e-03 0s 6 4.54370170e+01 3.34215399e+01 3.46e+00 1.22e-15 2.33e-03 0s 7 4.33379611e+01 3.68556638e+01 1.51e+00 1.77e-15 1.19e-03 0s 8 4.08012941e+01 3.84517412e+01 5.00e-02 1.11e-15 3.93e-04 0s 9 4.03252018e+01 3.94142363e+01 1.31e-02 9.72e-16 1.52e-04 0s 10 4.01364611e+01 3.98343544e+01 3.83e-03 1.41e-15 5.04e-05 0s 11 4.00594270e+01 3.99396604e+01 1.34e-03 1.96e-15 2.00e-05 0s 12 4.00271013e+01 3.99747408e+01 5.39e-04 1.16e-15 8.72e-06 0s 13 4.00086082e+01 3.99935592e+01 1.57e-04 8.75e-16 2.51e-06 0s 14 4.00004117e+01 3.99997230e+01 6.98e-06 1.11e-15 1.15e-07 0s 15 4.00000004e+01 3.99999997e+01 1.82e-14 9.45e-16 1.15e-10 0s 16 4.00000000e+01 4.00000000e+01 2.13e-14 1.08e-15 1.15e-13 0s Barrier solved model in 16 iterations and 0.04 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 419 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.00000 0 28 85.00000 40.00000 52.9% - 0s H 0 0 41.0000000 40.00000 2.44% - 0s 0 0 40.00000 0 48 41.00000 40.00000 2.44% - 0s 0 0 40.00000 0 63 41.00000 40.00000 2.44% - 0s 0 0 40.00000 0 94 41.00000 40.00000 2.44% - 0s 0 0 40.00000 0 109 41.00000 40.00000 2.44% - 0s 0 0 40.00000 0 109 41.00000 40.00000 2.44% - 0s 0 0 40.00000 0 109 41.00000 40.00000 2.44% - 0s H 0 0 40.0000000 40.00000 0.0% - 0s Cutting planes: Zero half: 2 Explored 0 nodes (2857 simplex iterations) in 0.41 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.13 seconds Gurobi run time: 0.41 seconds Total run time: 0.54 seconds Objective: 40 Solution: 1 x [1, 56, 73] 1 x [87, 105, 115] 1 x [46, 64, 83] 1 x [30, 108, 117] 1 x [39, 51, 52] 1 x [18, 62, 97] 1 x [9, 10, 41] 1 x [20, 110, 112] 1 x [4, 15, 100] 1 x [36, 82, 86] 1 x [25, 54, 90] 1 x [94, 101, 104] 1 x [43, 66, 95] 1 x [21, 113, 118] 1 x [57, 67, 80] 1 x [47, 85, 96] 1 x [60, 103, 114] 1 x [61, 69, 75] 1 x [27, 65, 106] 1 x [19, 26, 71] 1 x [32, 109, 111] 1 x [8, 31, 68] 1 x [42, 79, 120] 1 x [35, 40, 81] 1 x [14, 33, 55] 1 x [70, 72, 119] 1 x [13, 38, 59] 1 x [5, 37, 92] 1 x [22, 23, 24] 1 x [2, 17, 49] 1 x [7, 50, 116] 1 x [34, 98, 107] 1 x [3, 29, 88] 1 x [28, 74, 99] 1 x [11, 58, 93] 1 x [44, 45, 76] 1 x [48, 63, 77] 1 x [84, 89, 91] 1 x [6, 53, 102] 1 x [12, 16, 78]