Presidential Young Investigator Award: Efficient Algorithms in Combinatorial Optimization

本研究旨在设计和分析 组合算法 它特别关注的是， 组合优化强多项式算法 与线性和整数规划有关的问题和问题。 网络、交通、配套问题被追责。 在这个问题领域的成果价值极高。

This research is directed toward the design and analysis of combinatorial algorithms. In particular, it is concerned with strongly polynomial algorithms for combinatorial optimization problems and problems related to linear and integer programming. Network, transportation, and matching problems are being pursued. The value of results in this problem area is extremely high.