报告人：范能（美国亚利桑那大学副教授）
地点：教学楼427
时间：11:15--12:15
报告摘要：Many combinatorial optimization problems can be considered as finding a subgraph of a given graph with different requirements of graph properties (e.g., spanning tree problems, dominating set, connected subgraph). They can be generalized for network design in different application areas, such as power grids, communication networks, supply chain, social network ****ysis, etc. The network design has many requirements, such as survivability (to maintain maximum network connectivity and quality of service under failure conditions), and robustness (to withstand failures and perturbations), which can be ensured by corresponding graph properties. In this talk, we will revisit some classic combinatorial optimization problems from subgraph perspective, and then discuss two survivable network design problems via subgraph identification.
报告人简介：范能，美国亚利桑那大学系统与工程系副教授，在武汉大学应用数学系获得学士学位，南开大学获得硕士学位，美国佛罗里达大学获得硕士学位与博士学位。曾经在洛斯阿拉莫斯国家实验室与桑迪亚国家实验室工作。主要研究方向是开发各种优化方法，以及它们在能源系统、可再生能源集成、医疗保健、可持续农业和数据分析中的应用。