Build (method = -2) #dp: 20018 Step-3' Graph: 745 vertices and 4449 arcs (0.18s) Step-4' Graph: 270 vertices and 3499 arcs (0.18s) #V4/#V3 = 0.36 #A4/#A3 = 0.79 Ready! (0.18s) Optimize a model with 390 rows, 3500 columns and 9964 nonzeros Presolve removed 72 rows and 72 columns Presolve time: 0.03s Presolved: 318 rows, 3428 columns, 9962 nonzeros Variable types: 0 continuous, 3428 integer (3086 binary) Found heuristic solution: objective 108.0000000 Optimize a model with 318 rows, 3428 columns and 9962 nonzeros Presolved: 318 rows, 3428 columns, 9962 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.086e+03 Factor NZ : 1.473e+04 (roughly 2 MBytes of memory) Factor Ops : 1.039e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.99099081e+03 -2.28540240e+04 5.69e+04 3.22e-01 2.21e+01 0s 1 1.72081581e+03 -4.22689295e+03 9.79e+03 6.11e-16 3.70e+00 0s 2 2.29978098e+02 -6.46056643e+02 6.20e+02 5.55e-16 3.00e-01 0s 3 9.86838581e+01 -1.22076406e+02 1.35e+02 5.00e-16 6.75e-02 0s 4 6.05596552e+01 -1.11291779e+01 2.55e+01 4.44e-16 1.64e-02 0s 5 4.89015587e+01 4.43294097e+00 5.03e+00 4.44e-16 7.44e-03 0s 6 4.55066738e+01 2.89022006e+01 2.05e+00 3.33e-16 2.61e-03 0s 7 4.20535911e+01 3.30217703e+01 4.60e-01 2.22e-16 1.35e-03 0s 8 4.09492859e+01 3.66728376e+01 1.65e-01 3.33e-16 6.34e-04 0s 9 4.03350758e+01 3.94938627e+01 3.21e-02 3.33e-16 1.24e-04 0s 10 4.01306065e+01 3.98162411e+01 8.69e-03 2.75e-16 4.63e-05 0s 11 4.00723709e+01 3.99132334e+01 4.32e-03 2.22e-16 2.34e-05 0s 12 4.00283901e+01 3.99582422e+01 1.49e-03 2.22e-16 1.03e-05 0s 13 4.00086256e+01 3.99927342e+01 4.03e-04 2.35e-16 2.34e-06 0s 14 4.00000525e+01 3.99998911e+01 3.82e-08 3.04e-16 2.35e-08 0s 15 4.00000000e+01 4.00000000e+01 4.05e-13 3.33e-16 1.64e-13 0s Barrier solved model in 15 iterations and 0.04 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 452 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.00000 0 95 108.00000 40.00000 63.0% - 0s H 0 0 42.0000000 40.00000 4.76% - 0s 0 0 40.00000 0 148 42.00000 40.00000 4.76% - 0s H 0 0 41.0000000 40.00000 2.44% - 0s * 0 0 0 40.0000000 40.00000 0.0% - 0s Cutting planes: Clique: 1 Zero half: 24 Explored 0 nodes (2321 simplex iterations) in 0.65 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.20 seconds Gurobi run time: 0.65 seconds Total run time: 0.85 seconds Objective: 40 Solution: 1 x [6, 13, 17] 1 x [46, 47, 48] 1 x [64, 65, 66] 1 x [18, 89, 99] 1 x [11, 67, 116] 1 x [4, 68, 86] 1 x [79, 92, 93] 1 x [96, 105, 109] 1 x [56, 97, 106] 1 x [31, 60, 120] 1 x [40, 41, 57] 1 x [5, 32, 73] 1 x [36, 108, 111] 1 x [24, 35, 70] 1 x [25, 102, 119] 1 x [7, 51, 59] 1 x [75, 100, 117] 1 x [15, 37, 39] 1 x [14, 61, 74] 1 x [12, 23, 82] 1 x [19, 38, 90] 1 x [10, 26, 101] 1 x [53, 55, 62] 1 x [9, 78, 88] 1 x [2, 50, 85] 1 x [28, 83, 110] 1 x [16, 54, 98] 1 x [58, 63, 69] 1 x [27, 84, 103] 1 x [3, 8, 76] 1 x [77, 91, 113] 1 x [87, 94, 114] 1 x [34, 52, 104] 1 x [20, 107, 118] 1 x [29, 95, 112] 1 x [43, 44, 45] 1 x [1, 42, 71] 1 x [33, 49, 80] 1 x [21, 22, 81] 1 x [30, 72, 115]