Leyuan Shi

Papers

Total Citations

H-Index

About

Leyuan Shi is a prominent figure in operations research and combinatorial optimization, best known for advancing parallel and randomized algorithms for complex scheduling and routing problems. Her seminal work, "New parallel randomized algorithms for the traveling salesman problem" (1999), with 69 citations, introduced innovative approaches that leverage parallelism to efficiently tackle the classic Traveling Salesman Problem, a cornerstone of logistics and network design. This contribution has had a lasting impact on the development of scalable heuristics for NP-hard problems. Beyond this, Shi's research spans simulation optimization, discrete event systems, and supply chain management, where she has developed novel methodologies that bridge theoretical algorithms with practical industrial applications. Her work is widely recognized for its rigor and applicability, influencing both academic research and real-world decision-making in manufacturing and transportation. Shi's achievements include leadership roles in professional societies and editorial boards, underscoring her influence in shaping the field. For students and researchers, her legacy offers a model of how algorithmic innovation can drive efficiency in complex systems.