For which of the following situations would it be best to use a heuristic in order to find a solution that runs in a reasonable amount of time?

Question

Anonymous · Answer

Finding the fastest route that visits every location among n locations, which requires n! possible routes be examined.

1 Answer