Metraipolis › archive › dc_3b02682e23fd

Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem — Europe PMC PMID:41345135

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/41345135
DOI
10.1038/s41467-[numero omesso]-9
License (as archived)
solo-consultazione
Archived
2026-10-07T16:42:19.954Z
SHA-256 of the archived text
7515deabf9f9a0868688694cdbb5a3d1a4324c405bf49fb189830b43983ef6cd
Stable URL of this page
https://metraipolis.com/documento/dc_3b02682e23fd

How to cite

Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem — Europe PMC PMID:41345135 — Europe PMC (en), https://europepmc.org/article/MED/41345135 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_3b02682e23fd (Metraipolis archive dc_3b02682e23fd, sha256 7515deabf9f9a0868688694cdbb5a3d1a4324c405bf49fb189830b43983ef6cd)
BibTeX
@misc{dc3b02682e23fd,
  title = {Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem — Europe PMC PMID:41345135},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/41345135},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_3b02682e23fd; sha256 7515deabf9f9a0868688694cdbb5a3d1a4324c405bf49fb189830b43983ef6cd},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/41345135. Agents can read the archived copy with the MCP tool read_document.