Sicong Wang

Papers

Total Citations

H-Index

About

Sicong Wang is a researcher whose work centers on combinatorial optimization, with a particular focus on the traveling salesman problem (TSP)—a classic and computationally challenging problem in operations research and computer science. Wang’s most cited paper, “Review of Traveling Salesman Problem Solution Methods” (2024), has already garnered 9 citations, reflecting its timely synthesis of exact, heuristic, and metaheuristic approaches. This comprehensive review not only catalogues established techniques but also critically evaluates emerging trends, such as machine learning–driven solvers, offering a valuable roadmap for both newcomers and seasoned researchers. Wang’s contribution lies in distilling a vast, fragmented literature into an accessible framework, highlighting trade-offs between solution quality and computational efficiency. By bridging theoretical foundations with practical applications—from logistics to circuit design—Wang’s work serves as a key reference for advancing TSP research. With growing recognition in the optimization community, Sicong Wang is establishing a reputation for clarity and insight, making complex problems more approachable for students and practitioners alike.