Yichun Su

Papers

Total Citations

H-Index

About

Yichun Su is a rising researcher in combinatorial optimization and algorithmic design, with a primary focus on solving complex discrete optimization problems. Their most notable contribution is the development of the IDINFO algorithm, introduced in their highly cited 2025 paper, "Solving the Traveling Salesman Problem Using the IDINFO Algorithm." This work addresses the Traveling Salesman Problem (TSP), a foundational challenge in fields such as robotics, transportation, and networking, by proposing a novel approach that significantly improves convergence speed and solution quality. Despite its recent publication, the paper has already garnered 4 citations, signaling growing recognition of Su’s innovative methodology. Su’s research bridges theoretical algorithm design and practical applications, offering efficient solutions to real-world routing and logistics challenges. Their work stands out for its potential to enhance performance in autonomous systems and network optimization, making Su a promising voice in the optimization community. As their citation impact continues to rise, Yichun Su is poised to make further strides in advancing algorithmic efficiency for combinatorial problems.