Contains code meant to optimize the route for a tourist visiting the Louvre Museum, such that the satisfaction level is maximised by visiting all/select exhibits in a single working day.
MIT License
10
stars
8
forks
source link
Add initial codes for Simulated Annealing and Branch & Bound Algorithms #9
Hello @Prajwal-Prathiksh! Thanks for opening this PR.
code/branch_and_bound/algorithm.py
:Do see the Hitchhiker's guide to code style