Longrui Yang

Papers

Total Citations

H-Index

About

Longrui Yang is a researcher whose work centers on combinatorial optimization and algorithmic problem-solving, with a particular focus on the Traveling Salesman Problem (TSP)—a cornerstone challenge in operations research and computer science. Yang’s major contribution is a comprehensive review of TSP solution methods, published in 2024, which synthesizes decades of algorithmic advances, from exact approaches like branch-and-bound to modern heuristics and metaheuristics. This review has quickly become a key reference for researchers and practitioners, garnering 9 citations in its first year—a strong indicator of its immediate relevance and utility. By systematically categorizing and comparing solution strategies, Yang’s work provides a clear roadmap for tackling TSP variants, aiding fields as diverse as logistics, manufacturing, and DNA sequencing. The paper’s clarity and depth make it a valuable resource for students entering optimization research. Yang’s ability to distill complex methodologies into an accessible framework highlights a talent for bridging theory and application, positioning this review as a foundational text for future studies in combinatorial optimization.