<@UBBFK40RZ> Keep in mind too that your branch-and...
# datascience
t
@Nikky Keep in mind too that your branch-and-bound algorithm (or branch-and-prune I should say?) should prune and eliminate branches the moment an overlap or other infraction is met. It is critical to use constraints not just to satisfy your business requirements but also reduce your search space. As a matter of fact, if you want to be ultra-efficient just eliminate nodes going forward that you should no longer explore (which I did here)