Build (method = -2) #dp: 4638 Step-3' Graph: 181 vertices and 972 arcs (0.02s) Step-4' Graph: 148 vertices and 906 arcs (0.02s) #V4/#V3 = 0.82 #A4/#A3 = 0.93 Ready! (0.02s) Optimize a model with 207 rows, 907 columns and 2429 nonzeros Presolve removed 20 rows and 39 columns Presolve time: 0.02s Presolved: 187 rows, 868 columns, 2239 nonzeros Variable types: 0 continuous, 868 integer (315 binary) Found heuristic solution: objective 64.0000000 Optimize a model with 187 rows, 868 columns and 2239 nonzeros Presolved: 187 rows, 868 columns, 2239 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.642e+03 Factor NZ : 7.300e+03 Factor Ops : 4.146e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.23197657e+03 -3.52793176e+03 5.66e+03 3.12e-01 2.19e+01 0s 1 3.57868400e+02 -1.84673107e+03 5.78e+02 3.44e-15 3.00e+00 0s 2 1.21540420e+02 -4.09506344e+02 4.56e+01 2.78e-15 4.01e-01 0s 3 7.00779263e+01 -9.81931736e+01 6.06e+00 1.94e-15 1.03e-01 0s 4 4.67013066e+01 -1.26634956e+01 1.06e+00 2.18e-15 3.44e-02 0s 5 3.94535801e+01 1.24113810e+01 4.77e-01 2.18e-15 1.55e-02 0s 6 3.20168700e+01 2.59940404e+01 7.19e-02 2.31e-15 3.44e-03 0s 7 3.00750844e+01 2.99059051e+01 5.61e-04 2.59e-15 9.62e-05 0s 8 3.00000050e+01 2.99999914e+01 3.86e-08 2.28e-15 7.69e-09 0s 9 3.00000000e+01 3.00000000e+01 1.40e-13 2.12e-15 7.69e-12 0s 10 3.00000000e+01 3.00000000e+01 1.42e-14 1.95e-15 7.69e-15 0s Barrier solved model in 10 iterations and 0.01 seconds Optimal objective 3.00000000e+01 Root relaxation: objective 3.000000e+01, 261 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 30.0000000 30.00000 0.0% - 0s Explored 0 nodes (360 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 30 Solution: 1 x [1, 25, 43, 52] 1 x [1, 30, 35, 54] 1 x [2, 24, 43, 52] 1 x [2, 27, 35, 56] 1 x [3, 27, 40, 50] 1 x [4, 22, 41, 54] 1 x [4, 26, 41, 50] 1 x [5, 30, 39, 46] 1 x [6, 20, 39, 57] 1 x [7, 18, 44, 53] 1 x [8, 17, 42, 55] 1 x [8, 25, 31, 58] 1 x [9, 28, 33, 52] 1 x [10, 22, 31, 59] 1 x [11, 18, 41, 52] 1 x [12, 18, 35, 57] 1 x [12, 19, 41, 50] 2 x [12, 21, 41, 47] 1 x [12, 28, 35, 45] 1 x [12, 29, 32, 49] 1 x [13, 21, 34, 55] 1 x [13, 21, 39, 48] 1 x [14, 22, 34, 53] 1 x [14, 23, 39, 45] 1 x [15, 18, 36, 53] 1 x [15, 20, 37, 50] 1 x [15, 23, 38, 45] 1 x [16, 17, 35, 54] 1 x [16, 18, 37, 51]