Build (method = -2) #dp: 5690 Step-3' Graph: 1047 vertices and 3134 arcs (0.04s) Step-4' Graph: 540 vertices and 2120 arcs (0.05s) #V4/#V3 = 0.52 #A4/#A3 = 0.68 Ready! (0.05s) Optimize a model with 580 rows, 2121 columns and 5287 nonzeros Presolve removed 100 rows and 177 columns Presolve time: 0.04s Presolved: 480 rows, 1944 columns, 5177 nonzeros Variable types: 0 continuous, 1944 integer (248 binary) Found heuristic solution: objective 273.0000000 Optimize a model with 480 rows, 1944 columns and 5177 nonzeros Presolved: 480 rows, 1944 columns, 5177 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.469e+03 Factor NZ : 1.798e+04 (roughly 1 MByte of memory) Factor Ops : 1.086e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.29996647e+03 -3.45720479e+04 1.12e+05 2.22e-16 1.51e+02 0s 1 9.28170752e+02 -2.06133443e+04 1.43e+04 7.77e-16 2.24e+01 0s 2 4.47547735e+02 -8.21167905e+03 2.26e+03 1.33e-15 4.52e+00 0s 3 3.29030440e+02 -1.91812751e+03 3.60e+02 8.88e-15 8.70e-01 0s 4 2.98485670e+02 -6.68093906e+02 5.92e+01 7.55e-15 2.80e-01 0s 5 2.81154796e+02 -4.54198265e+02 2.75e+01 5.33e-15 2.01e-01 0s 6 2.67481959e+02 -2.78060392e+02 1.80e+01 3.89e-15 1.47e-01 0s 7 2.48516640e+02 -8.47470774e+01 4.49e+00 2.33e-15 8.68e-02 0s 8 2.36139172e+02 -3.92161289e+01 2.90e+00 2.00e-15 7.14e-02 0s 9 2.22837168e+02 7.02221653e+01 1.47e+00 8.88e-16 3.95e-02 0s 10 2.02373285e+02 1.45852188e+02 3.11e-01 5.48e-16 1.45e-02 0s 11 1.98173308e+02 1.74344772e+02 8.93e-02 3.01e-16 6.12e-03 0s 12 1.96163520e+02 1.94063196e+02 5.24e-03 3.55e-16 5.39e-04 0s 13 1.96000106e+02 1.95999690e+02 3.19e-06 3.49e-16 1.07e-07 0s 14 1.96000000e+02 1.96000000e+02 3.21e-12 4.68e-16 1.08e-13 0s Barrier solved model in 14 iterations and 0.04 seconds Optimal objective 1.96000000e+02 Root relaxation: objective 1.960000e+02, 991 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 196.0000000 196.00000 0.0% - 0s Explored 0 nodes (991 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.960000000000e+02, best bound 1.960000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.13 seconds Total run time: 0.20 seconds Objective: 196 Solution: 4 x [1] 2 x [1, 33] 2 x [1, 35] 11 x [1, 37] 5 x [2, 35] 4 x [3] 1 x [3, 33] 1 x [3, 34] 1 x [3, 34, 40] 5 x [3, 38] 5 x [4] 1 x [5, 28] 11 x [5, 31] 4 x [5, 33] 3 x [6] 4 x [6, 29] 3 x [7, 39] 4 x [8] 5 x [8, 25] 5 x [8, 28] 3 x [8, 28, 37] 6 x [9, 24] 4 x [10] 8 x [10, 24] 1 x [11, 32] 6 x [12, 35, 40] 1 x [13, 23, 40] 2 x [13, 24] 4 x [13, 26] 2 x [13, 26, 40] 5 x [13, 29, 30, 33] 4 x [13, 33, 35, 40] 2 x [14, 22, 40] 7 x [14, 26] 4 x [14, 28, 36] 1 x [14, 28, 40] 5 x [15, 21] 6 x [15, 23] 3 x [15, 24] 4 x [15, 27] 1 x [16] 7 x [17] 10 x [17, 20] 8 x [18, 19] 7 x [18, 20] 2 x [18, 29, 34] 2 x [18, 34]