Build (method = -2) #dp: 14133 Step-3' Graph: 213 vertices and 2584 arcs (0.07s) Step-4' Graph: 190 vertices and 2538 arcs (0.07s) #V4/#V3 = 0.89 #A4/#A3 = 0.98 Ready! (0.07s) Optimize a model with 230 rows, 2539 columns and 7247 nonzeros Presolve removed 10 rows and 19 columns Presolve time: 0.02s Presolved: 220 rows, 2520 columns, 7210 nonzeros Variable types: 0 continuous, 2520 integer (0 binary) Found heuristic solution: objective 585.0000000 Optimize a model with 220 rows, 2520 columns and 7210 nonzeros Presolved: 220 rows, 2520 columns, 7210 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.489e+03 Factor NZ : 1.104e+04 (roughly 1 MByte of memory) Factor Ops : 6.863e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.91576936e+04 -1.13951890e+05 8.75e+04 2.22e-16 2.80e+02 0s 1 5.50531343e+03 -5.28745179e+04 1.59e+04 6.66e-16 5.46e+01 0s 2 1.73513735e+03 -2.41606747e+04 3.25e+03 1.02e-14 1.30e+01 0s 3 7.97020061e+02 -6.05682549e+03 3.32e+02 6.00e-15 1.91e+00 0s 4 6.74699513e+02 -2.87192638e+03 1.59e+00 3.33e-15 7.00e-01 0s 5 5.79974288e+02 -1.71125961e+03 1.10e-03 2.22e-15 4.51e-01 0s 6 4.45259173e+02 -8.10820066e+02 6.90e-04 9.99e-16 2.47e-01 0s 7 2.49546170e+02 -3.67711428e+02 3.37e-04 6.66e-16 1.22e-01 0s 8 1.69682825e+02 -1.34385100e+02 1.86e-04 4.44e-16 5.99e-02 0s 9 1.40249936e+02 4.24070998e+01 7.99e-05 3.12e-16 1.93e-02 0s 10 1.21759834e+02 6.82843883e+01 3.65e-05 3.60e-16 1.05e-02 0s 11 1.14189009e+02 8.64454340e+01 1.56e-05 3.50e-16 5.46e-03 0s 12 1.11266321e+02 9.95021497e+01 9.54e-06 2.88e-16 2.32e-03 0s 13 1.09932146e+02 1.02767926e+02 6.54e-06 3.03e-16 1.41e-03 0s 14 1.07507136e+02 1.06057581e+02 8.80e-07 3.33e-16 2.85e-04 0s 15 1.07168053e+02 1.06990898e+02 1.48e-07 4.44e-16 3.49e-05 0s 16 1.07100074e+02 1.07099822e+02 1.44e-13 3.44e-16 4.95e-08 0s 17 1.07100000e+02 1.07100000e+02 9.91e-14 3.33e-16 4.97e-14 0s Barrier solved model in 17 iterations and 0.04 seconds Optimal objective 1.07100000e+02 Root relaxation: objective 1.071000e+02, 1936 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 107.10000 0 67 585.00000 107.10000 81.7% - 0s H 0 0 108.0000000 107.10000 0.83% - 0s Explored 0 nodes (4085 simplex iterations) in 0.33 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.080000000000e+02, best bound 1.080000000000e+02, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.33 seconds Total run time: 0.42 seconds Objective: 108 Solution: 2 x [4, 7, 8, 13, 14, 16, 37] 1 x [4, 7, 13, 14, 16, 37] 3 x [18, 20, 20, 22, 23, 33, 35] 1 x [2, 22, 23, 26] 1 x [2, 5, 12, 22, 23, 26] 8 x [10, 10, 13, 23, 25, 27, 36] 1 x [4, 6, 6, 6, 13, 23, 25] 5 x [17, 24, 27, 32, 38] 1 x [10, 25, 28, 32, 38] 1 x [10, 20, 25, 28, 32, 38] 1 x [9, 9, 10, 18, 22] 4 x [5, 9, 12, 21, 26, 28] 5 x [8, 9, 20, 21, 24, 34, 35] 3 x [20, 21, 28, 34, 40] 1 x [5, 18, 21, 28, 34, 38] 1 x [5, 18, 21, 38] 1 x [20, 21, 28, 34] 13 x [13, 19, 27, 34, 35, 38] 2 x [10, 10, 13, 19, 27, 31, 38] 1 x [4, 6, 6, 6, 19, 38] 3 x [2, 4, 6, 6, 6, 13, 19] 2 x [7, 7, 13, 19, 29, 36] 4 x [7, 19, 29, 36, 36, 37] 5 x [11, 18, 20, 26, 33, 40] 1 x [2, 15, 25, 27, 33, 35] 4 x [5, 12, 15, 15, 33, 37] 3 x [3, 16, 26, 31, 31, 33, 37] 1 x [7, 7, 7, 31, 31, 33, 37] 11 x [8, 11, 11, 17, 20, 24, 35] 1 x [3, 13, 26, 26, 30, 31, 31] 4 x [1, 3, 16, 26, 30, 31, 31] 13 x [3, 25, 26, 29, 31, 36, 39]