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

美国-意大利合作研究：最短路径和其他网络优化问题

• 批准号: 9221293
• 负责人: Dimitri Bertsekas
• 金额: $ 1.33万
• 依托单位: Massachusetts Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-09-15 至 1996-02-29
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9221293&HistoricalAwards=false
• 关键词: U.S.; Italy; Cooperative; Research; Shortest

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. ***

9221293 Bertsekas 该奖项将支持麻省理工学院的 Dimitri Bertsekas 和意大利比萨大学的 Stefano Pallottino 之间的合作研究。 合作研究将重点关注具有网络结构的优化问题，特别是最短路径问题。 该研究将寻求了解现有最短路径和其他网络算法的性能，特别强调最近提出的称为拍卖算法的类别。 合作的主要好处是互补的技能和兼容的研究观点的结合。 Pallottino 教授是世界上最重要的最短路径算法专家之一，Bertsekas 教授是网络优化拍卖算法类的主要开发人员。 研究将集中在三个主要方面：1）算法开发； 2) 性能和复杂性分析，以及 3) 实验验证，其中每个合作者对这些领域中的一个或多个领域承担主要责任。 ***