Home › Entities › academia › Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

Research article (IEEE Transactions on Automation Science and Engineering, 2023) · cited 22× · AI/ML
academia openalex:W4378804809
Press Enter · cited answer in seconds

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

Summary

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems is a scholarly article[1].

Key Facts

  • Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

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.

APA 4ort.xyz Knowledge Graph. (2026). Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems. Retrieved May 24, 2026, from https://4ort.xyz/entity/bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems
MLA “Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems.
BibTeX @misc{4ortxyz_bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems}}, year = {2026}, url = {https://4ort.xyz/entity/bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems — https://4ort.xyz/entity/bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/bi-trajectory-hybrid-search-to-solve-bottleneck-minimized-colored-traveling-salesman-problems · Last refreshed: