Build (method = -2) #dp: 7803 Step-3' Graph: 1560 vertices and 4673 arcs (0.06s) Step-4' Graph: 600 vertices and 2753 arcs (0.07s) #V4/#V3 = 0.38 #A4/#A3 = 0.59 Ready! (0.07s) Optimize a model with 640 rows, 2754 columns and 7066 nonzeros Presolve removed 94 rows and 174 columns Presolve time: 0.05s Presolved: 546 rows, 2580 columns, 7015 nonzeros Variable types: 0 continuous, 2580 integer (281 binary) Found heuristic solution: objective 231.0000000 Optimize a model with 546 rows, 2580 columns and 7015 nonzeros Presolve removed 3 rows and 3 columns Presolved: 543 rows, 2577 columns, 7035 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 4.702e+03 Factor NZ : 2.108e+04 (roughly 1 MByte of memory) Factor Ops : 1.349e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.88925381e+03 -4.46912139e+04 1.40e+05 9.86e-02 1.58e+02 0s 1 1.44020538e+03 -2.62097225e+04 1.78e+04 7.77e-16 2.30e+01 0s 2 6.12197678e+02 -1.04634668e+04 3.39e+03 7.77e-16 5.11e+00 0s 3 3.33170021e+02 -2.42671547e+03 3.33e+02 6.88e-15 7.62e-01 0s 4 2.85309858e+02 -3.68419565e+02 7.65e+01 1.44e-15 1.60e-01 0s 5 2.68224127e+02 -2.64038407e+02 3.21e+01 1.33e-15 1.15e-01 0s 6 2.51043471e+02 -1.71648211e+02 2.41e+01 7.77e-16 9.02e-02 0s 7 2.09362810e+02 -6.69371131e+01 1.27e+01 4.44e-16 5.74e-02 0s 8 1.89997193e+02 3.62185135e+01 8.23e+00 4.44e-16 3.19e-02 0s 9 1.74938586e+02 7.41811950e+01 5.25e+00 3.89e-16 2.06e-02 0s 10 1.61337014e+02 1.06450149e+02 1.84e+00 3.65e-16 1.09e-02 0s 11 1.56202213e+02 1.14951976e+02 9.92e-01 5.55e-16 8.13e-03 0s 12 1.53756181e+02 1.28524411e+02 6.07e-01 4.44e-16 4.96e-03 0s 13 1.51860624e+02 1.38756853e+02 3.64e-01 3.82e-16 2.58e-03 0s 14 1.49442367e+02 1.44148085e+02 6.71e-02 3.06e-16 1.03e-03 0s 15 1.49029330e+02 1.48809647e+02 9.80e-04 3.44e-16 4.25e-05 0s 16 1.49000073e+02 1.48999782e+02 9.13e-13 3.97e-16 5.60e-08 0s 17 1.49000000e+02 1.49000000e+02 4.83e-13 3.23e-16 5.60e-11 0s Barrier solved model in 17 iterations and 0.06 seconds Optimal objective 1.49000000e+02 Root relaxation: objective 1.490000e+02, 1124 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 149.0000000 149.00000 0.0% - 0s Explored 0 nodes (1124 simplex iterations) in 0.19 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.490000000000e+02, best bound 1.490000000000e+02, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.19 seconds Total run time: 0.28 seconds Objective: 149 Solution: 16 x [1, 30] 2 x [2, 29, 39] 1 x [2, 30, 40] 9 x [2, 31] 1 x [3, 25, 40] 6 x [3, 26] 7 x [4, 24] 5 x [4, 25, 40] 3 x [4, 27] 2 x [4, 28] 2 x [5, 17] 2 x [5, 17, 37] 4 x [6, 14] 9 x [6, 15, 37] 2 x [6, 17] 9 x [7, 11] 12 x [8, 9] 6 x [8, 10] 1 x [8, 23, 34] 2 x [9, 10, 36] 2 x [10, 15] 9 x [10, 17, 33] 1 x [11, 15] 4 x [11, 18, 34, 36] 4 x [12, 19, 31, 40] 5 x [13, 14, 35, 37, 38] 1 x [13, 17, 32] 2 x [14, 20, 29, 40] 4 x [14, 23, 33, 37, 38] 3 x [15, 16, 31] 2 x [15, 19, 35] 2 x [16, 19, 35] 1 x [18, 20, 35, 36, 40] 1 x [19, 21, 30, 36] 4 x [19, 22, 23] 3 x [19, 23, 28, 36]