Home ›
Entities
› academia
› Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures
Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures
Research article (The Journal of Supercomputing, 2017) · cited 83× · AI/ML
Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures
Summary
Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures is a scholarly article[1].
Key Facts
Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures. Retrieved May 24, 2026, from https://4ort.xyz/entity/solving-traveling-salesman-problem-using-parallel-repetitive-nearest-neighbor-algorithm-on-otis-hypercube-and-otis-mesh-
MLA“Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/solving-traveling-salesman-problem-using-parallel-repetitive-nearest-neighbor-algorithm-on-otis-hypercube-and-otis-mesh-.
BibTeX@misc{4ortxyz_solving-traveling-salesman-problem-using-parallel-repetitive-nearest-neighbor-algorithm-on-otis-hypercube-and-otis-mesh-_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures}}, year = {2026}, url = {https://4ort.xyz/entity/solving-traveling-salesman-problem-using-parallel-repetitive-nearest-neighbor-algorithm-on-otis-hypercube-and-otis-mesh-}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures — https://4ort.xyz/entity/solving-traveling-salesman-problem-using-parallel-repetitive-nearest-neighbor-algorithm-on-otis-hypercube-and-otis-mesh- (retrieved 2026-05-24)
