U.S. - Italy Cooperative Research: Shortest Path and Other Network Optimization Problems

小行星9221293 该奖项将支持马萨诸塞州理工学院的Dimitri Bertsekas和意大利比萨大学的Stefano Pallottino之间的合作研究。 合作研究将集中在具有网络结构的优化问题，特别是最短路径问题。 这项研究将试图了解现有的最短路径和其他网络算法的性能，特别强调最近提出的一类称为拍卖算法。 合作的主要好处是加入互补的技能和兼容的研究观点。 Pallottino教授是世界上最短路径算法方面最重要的专家之一，Bertsekas教授是网络优化拍卖算法类的主要开发者。 研究将集中在三个主要方面：1）算法开发; 2）性能和复杂性分析; 3）实验验证，其中每个合作者主要负责其中一个或多个领域。 ***

9221293 Bertsekas This award will support collaborative research between Dimitri Bertsekas, Massachusetts Institute of Technology, and Stefano Pallottino, University of Pisa, Italy. The collaborative research will focus on optimization problems that have a network structure, in particular, shortest path problems. The research will seek to understand the performance of existing shortest path and other network algorithms, with particular emphasis on a recently proposed class called auction algorithms. The primary benefit of the collaboration is the joining of complementary skills and compatible research views. Professor Pallottino is one of the world's foremost experts on shortest path algorithms, and Professor Bertsekas is a principal developer of the class of auction algorithms for network optimization. The research will focus on three main aspects: 1) algorithm development; 2) performance and complexity analysis, and 3) experimental validation, in which each of the collaborators takes primary responsibility for one or more of these areas. ***