Cargando…
Traveling salesman problem solution using magnonic combinatorial device
Traveling salesman problem (TSP) is a decision-making problem that is essential for a number of practical applications. Today, this problem is solved on digital computers exploiting Boolean-type architecture by checking one by one a number of possible routes. In this work, we describe a special type...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10359328/ https://www.ncbi.nlm.nih.gov/pubmed/37474594 http://dx.doi.org/10.1038/s41598-023-38839-7 |