Su Jia
Papers
1
Total Citations
5
H-Index
1
About
Su Jia is a rising researcher in combinatorial optimization and approximation algorithms, with a focus on solving complex routing and scheduling problems. Her most-cited work, "Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems" (2020), has garnered 5 citations, demonstrating early impact in the field. Jia’s major contributions lie in developing efficient algorithmic frameworks for the Traveling Salesman Problem (TSP) under real-world constraints, such as time windows and prize-collecting variants. Her research bridges theoretical computer science and practical logistics, offering provable performance guarantees for NP-hard problems. Notably, her work on time-window TSP addresses critical challenges in delivery scheduling and route planning, with potential applications in supply chain management and autonomous systems. Jia’s achievements include advancing the understanding of approximation ratios for these problems, providing tools that enable near-optimal solutions where exact methods fail. As a young researcher, her publications signal a promising trajectory in algorithm design, with implications for both theoretical computer science and operations research. Her work continues to inspire students and researchers exploring the intersection of optimization, graph theory, and real-world problem-solving.
Research Focus
Key Achievements
Top Papers
- 1