Solving the Travelling Salesman Problem based on Coupled Ring-Oscillators

When thinking of hard mathematical problems the notion of NP-hard usually comes into play. One of the most famous NP-hard problems is the Travelling Salesman Problem (TSP), which tries to solve the following: Given a list of cities and distances in-between them, what is the shortest possible route t...

ver descrição completa

Detalhes bibliográficos
Autor principal: Pinto, José Miguel Pinheiro da Silva (author)
Formato: masterThesis
Idioma:eng
Publicado em: 2020
Assuntos:
Ring Oscillators
Travelling Salesman Problem
Coupling
Oscillatory computing
Optimisation
Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Texto completo:http://hdl.handle.net/10362/93420
País:Portugal
Oai:oai:run.unl.pt:10362/93420

Texto Completo

http://hdl.handle.net/10362/93420

Registos relacionados