Build (method = -2) #dp: 1230 Step-3' Graph: 117 vertices and 599 arcs (0.01s) Step-4' Graph: 83 vertices and 531 arcs (0.01s) #V4/#V3 = 0.71 #A4/#A3 = 0.89 Ready! (0.01s) Optimize a model with 98 rows, 532 columns and 1438 nonzeros Presolve removed 9 rows and 15 columns Presolve time: 0.00s Presolved: 89 rows, 517 columns, 1417 nonzeros Variable types: 0 continuous, 517 integer (0 binary) Found heuristic solution: objective 611.0000000 Found heuristic solution: objective 602.0000000 Found heuristic solution: objective 456.0000000 Optimize a model with 89 rows, 517 columns and 1417 nonzeros Presolved: 89 rows, 517 columns, 1417 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.940e+02 Factor NZ : 2.200e+03 Factor Ops : 6.430e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.21435314e+03 -3.82269144e+04 4.08e+04 2.22e-16 2.61e+02 0s 1 2.25323903e+03 -1.25923052e+04 7.32e+03 7.77e-16 4.84e+01 0s 2 7.67358886e+02 -3.53413601e+03 6.66e+02 1.33e-15 6.78e+00 0s 3 3.90319811e+02 -5.75597323e+02 7.29e+01 1.89e-15 1.10e+00 0s 4 4.10315125e+02 -2.11694442e+02 4.72e+01 8.88e-16 6.76e-01 0s 5 2.34793545e+02 -7.37895624e+01 1.87e+01 5.55e-16 3.20e-01 0s 6 1.89090447e+02 1.76271322e+01 9.14e+00 3.33e-16 1.74e-01 0s 7 1.65700767e+02 7.65738464e+01 3.97e+00 4.44e-16 8.86e-02 0s 8 1.53913728e+02 1.19803561e+02 1.86e+00 3.12e-16 3.38e-02 0s 9 1.48451318e+02 1.27568933e+02 6.23e-01 3.30e-16 2.02e-02 0s 10 1.46141536e+02 1.39219818e+02 3.40e-01 2.62e-16 6.71e-03 0s 11 1.43902153e+02 1.43494532e+02 8.62e-03 2.64e-16 3.91e-04 0s 12 1.43800109e+02 1.43799690e+02 3.03e-12 5.55e-16 3.99e-07 0s 13 1.43800000e+02 1.43800000e+02 2.75e-12 3.33e-16 4.01e-13 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.43800000e+02 Root relaxation: objective 1.438000e+02, 320 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 143.80000 0 29 456.00000 143.80000 68.5% - 0s H 0 0 146.0000000 143.80000 1.51% - 0s 0 0 143.80000 0 34 146.00000 143.80000 1.51% - 0s H 0 0 144.0000000 143.80000 0.14% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (409 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.440000000000e+02, best bound 1.440000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 144 Solution: 3 x [2, 2, 6, 13, 13] 2 x [3, 7, 7, 10, 13] 2 x [4, 10, 11, 11, 13] 4 x [1, 9, 9, 10, 13] 6 x [4, 4, 8, 10, 15] 14 x [7, 9, 10, 13, 15] 3 x [7, 9, 9, 10, 13] 10 x [5, 10, 10, 13, 13] 2 x [6, 10, 10, 13, 13] 20 x [7, 10, 10, 13, 14] 2 x [7, 9, 10, 10, 13] 1 x [4, 10, 10, 13] 8 x [7, 7, 9, 12, 15] 12 x [3, 7, 7, 9, 15] 24 x [7, 7, 7, 7, 8] 1 x [6, 7, 7, 7, 7] 30 x [7, 7, 7, 7, 7]