Together with a fellow student i had the assignment of giving a presentation about the important traveling salesman problem in the Applied Mathematics course at Uni. It's fairly low-level since we are in the 2nd semester at this point – but i put some good effort into visually explaining the concept of both brute-force and dynamic programming by going in depth with explaining how to build the necessary graphs and permutation-sets in Java. I'd like to share it so it can be helpful to someone else.
Read full article from traveling salesman problem: brute force, dynamic programming, graphs, permutation sets | Benjamin Aaron
No comments:
Post a Comment