https://github.com/kurianbenoy/travellingsanta

My solution for Kaggle Competition(https://www.kaggle.com/c/traveling-santa-2018-prime-paths)
https://github.com/kurianbenoy/travellingsanta

Last synced: 9 days ago
JSON representation

My solution for Kaggle Competition(https://www.kaggle.com/c/traveling-santa-2018-prime-paths)

• Host: GitHub
• URL: https://github.com/kurianbenoy/travellingsanta
• Owner: kurianbenoy
• License: mit
• Created: 2018-12-10T14:25:09.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2018-12-10T15:18:51.000Z (about 6 years ago)
• Last Synced: 2024-11-15T03:51:34.268Z (2 months ago)
• Language: Jupyter Notebook
• Size: 13.4 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 3
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# TravellingSanta

My solution for Kaggle Competition(https://www.kaggle.com/c/traveling-santa-2018-prime-paths)

This is a travelling salesman Problem to find shortest path for santa having 197768 points with about **1.215000 E+961518 distinct

paths to finds shortest distance**