Build (method = -2) #dp: 2201 Step-3' Graph: 68 vertices and 294 arcs (0.01s) Step-4' Graph: 28 vertices and 214 arcs (0.01s) #V4/#V3 = 0.41 #A4/#A3 = 0.73 Ready! (0.01s) Optimize a model with 68 rows, 215 columns and 595 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.00s Presolved: 59 rows, 205 columns, 568 nonzeros Variable types: 0 continuous, 205 integer (0 binary) Found heuristic solution: objective 1448.0000000 Found heuristic solution: objective 1048.0000000 Optimize a model with 59 rows, 205 columns and 568 nonzeros Presolved: 59 rows, 205 columns, 568 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.190e+02 Factor NZ : 9.010e+02 Factor Ops : 1.578e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.40411770e+04 -2.57800389e+04 1.05e+04 2.22e-16 4.55e+02 0s 1 5.30630599e+03 -6.94753258e+03 1.19e+03 9.99e-16 6.00e+01 0s 2 1.54932704e+03 -1.56845949e+03 9.70e+01 5.55e-15 8.83e+00 0s 3 8.83542453e+02 -1.14484130e+02 1.23e+00 1.78e-15 2.26e+00 0s 4 6.67777468e+02 2.60774098e+02 1.96e-01 6.83e-16 9.19e-01 0s 5 6.07493869e+02 4.39415740e+02 7.97e-02 6.75e-16 3.79e-01 0s 6 5.79838509e+02 5.02608081e+02 3.49e-02 7.77e-16 1.74e-01 0s 7 5.64068887e+02 5.35450215e+02 1.18e-02 6.33e-16 6.46e-02 0s 8 5.54119907e+02 5.47064372e+02 6.85e-04 8.88e-16 1.59e-02 0s 9 5.53053903e+02 5.51638371e+02 1.28e-04 4.70e-16 3.20e-03 0s 10 5.52713703e+02 5.52691710e+02 1.44e-06 8.88e-16 4.96e-05 0s 11 5.52704555e+02 5.52704533e+02 6.17e-13 8.88e-16 4.96e-08 0s 12 5.52704545e+02 5.52704545e+02 1.26e-12 6.66e-16 4.96e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 5.52704545e+02 Root relaxation: objective 5.527045e+02, 40 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 552.70455 0 24 1048.00000 552.70455 47.3% - 0s H 0 0 554.0000000 552.70455 0.23% - 0s H 0 0 553.0000000 552.70455 0.05% - 0s Explored 0 nodes (49 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.530000000000e+02, best bound 5.530000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.01 seconds Total run time: 0.03 seconds Objective: 553 Solution: 8 x [27] 33 x [3, 10] 39 x [21, 24] 16 x [2, 24] 1 x [2, 5, 24] 25 x [1, 24, 36] 17 x [1, 7, 24] 8 x [3, 12, 39] 36 x [4, 39] 3 x [6, 35, 39] 1 x [3, 39] 10 x [31, 35, 37] 29 x [20, 35, 37] 2 x [6, 35, 37] 6 x [9, 37, 40] 18 x [23, 33] 39 x [19, 33] 17 x [11, 17, 33] 3 x [25, 33, 40] 18 x [18, 26, 32] 33 x [12, 26, 35] 10 x [25, 26, 40] 1 x [30, 32, 38] 6 x [16, 18, 38] 2 x [15, 30, 32] 22 x [2, 15, 34] 4 x [15, 34, 35] 11 x [15, 25, 29] 6 x [13, 15, 16] 18 x [5, 15, 15] 9 x [16, 29, 30] 22 x [14, 30, 40] 1 x [14, 16, 30] 6 x [7, 30, 30] 1 x [1, 30, 30] 43 x [4, 8, 12] 21 x [22, 28, 34] 8 x [22, 22, 28]