Computational constraints?
Viewed 70 times
Branch-and-bound is computation-intensive; but is there anything wrong with performing the bootstrap analysis using heuristic search instead?
waiting for moderation