Build (method = -2) #dp: 23628 Step-3' Graph: 506 vertices and 2591 arcs (0.23s) Step-4' Graph: 301 vertices and 2203 arcs (0.23s) #V4/#V3 = 0.59 #A4/#A3 = 0.85 Ready! (0.23s) Optimize a model with 342 rows, 2204 columns and 5992 nonzeros Presolve removed 63 rows and 129 columns Presolve time: 0.04s Presolved: 279 rows, 2075 columns, 5741 nonzeros Variable types: 0 continuous, 2075 integer (359 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 70.0000000 Optimize a model with 279 rows, 2075 columns and 5741 nonzeros Presolved: 279 rows, 2075 columns, 5741 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.841e+03 Factor NZ : 9.709e+03 (roughly 1 MByte of memory) Factor Ops : 5.020e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.39709358e+03 -2.40708351e+04 4.48e+04 1.70e-01 9.38e+01 0s 1 1.68198894e+03 -8.43050427e+03 9.83e+03 3.44e-15 2.04e+01 0s 2 2.46904707e+02 -3.57597261e+03 7.84e+02 1.78e-15 2.25e+00 0s 3 1.46289663e+02 -1.29413555e+03 8.10e+01 1.67e-15 4.46e-01 0s 4 1.13440129e+02 -2.73214270e+02 7.74e+00 2.00e-15 9.75e-02 0s 5 7.47884496e+01 -1.54516554e+02 2.98e+00 1.55e-15 5.65e-02 0s 6 7.51290217e+01 -1.31413172e+02 2.84e+00 1.38e-15 5.08e-02 0s 7 4.91997531e+01 -6.78647117e+01 1.50e+00 1.55e-15 2.87e-02 0s 8 2.22679066e+01 -4.23992008e+01 5.71e-01 1.54e-15 1.57e-02 0s 9 1.61529488e+01 -8.05067973e-01 2.63e-01 1.18e-15 4.12e-03 0s 10 1.38232468e+01 7.92035345e+00 1.39e-01 1.08e-15 1.43e-03 0s 11 1.34296491e+01 1.03881039e+01 7.08e-02 1.50e-15 7.36e-04 0s 12 1.26469159e+01 1.19267726e+01 4.73e-03 1.36e-15 1.73e-04 0s 13 1.25014897e+01 1.24849800e+01 6.54e-05 1.17e-15 3.95e-06 0s 14 1.25000000e+01 1.24999999e+01 7.38e-11 1.38e-15 3.32e-11 0s 15 1.25000000e+01 1.25000000e+01 1.28e-13 1.25e-15 3.32e-14 0s Barrier solved model in 15 iterations and 0.03 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 1539 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 35 70.00000 12.50000 82.1% - 0s H 0 0 16.0000000 12.50000 21.9% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (2123 simplex iterations) in 0.23 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.25 seconds Gurobi run time: 0.23 seconds Total run time: 0.47 seconds Objective: 13 Solution: 2 x [4, 5, 13, 13, 14, 20, 23, 41] 3 x [1, 5, 8, 10, 21, 33, 36, 40] 1 x [1, 3, 20, 25, 26, 29, 35, 39] 1 x [1, 1, 3, 9, 11, 25, 31, 36] 1 x [2, 6, 7, 7, 7, 29, 39, 40] 1 x [2, 12, 18, 19, 38] 1 x [12, 16, 26, 27, 30, 34, 34, 41] 1 x [12, 18, 24, 25, 32, 34, 37] 1 x [11, 18, 20, 22, 27, 28, 31, 35] 1 x [14, 15, 15, 17, 17, 17, 17, 20]