Diego Vicente personal blog

Using Self-Organizing Maps to Solve the Traveling Salesman Problem

diego.codes published 2018-01-217 min read

Using Self-Organizing Maps to solve the Traveling Salesman Problem The Traveling Salesman Problem is a well known challenge in Computer Science: it consists on finding the shortest route possible that traverses all cities in a given map only once. Although its simple explanation, this problem is, indeed, NP-Complete…

Points

107

HN comments

35

Submissions

1

Cited by

0 commenters

AI & Machine LearningMath & Algorithms2018

Related posts from the same era

Google Duplex: An AI System for Accomplishing Real World Tasks Over the Phone

Google AI Blog20181,875 points750 commentscited by 10 details

Microsoft is investing $1B in OpenAI

OpenAI Blog20191,119 points592 commentscited by 3 details

AI winter is well on its way

Filip Piekniewski2018993 points492 commentscited by 3 details

AlphaGo Zero: Learning from scratch

DeepMind Blog2017923 points311 commentscited by 5 details

Lessons learned building an ML trading system

Ttradientblog.com2019914 points187 comments details

AI Clones Your Voice After Listening for 5 Seconds (2018)

GGoogle on GitHub2019911 points319 commentscited by 5 details