>From those grouping new bounds to problem variables can be inferred.
As a result, larger problems (up to
300 activities per resource) can be handled, and optimization problems
can be tackled more effectively.
As a second aspect, I will discuss the impact of selection heuristics
in the branching scheme, and in particular the use of randomized
selection. As a result, the average deviation between best solution
and lower bound was found to be 3.63% for a benchmark suite of 36
medium size problems.