邀请人：戴国伟
摘要: Graph partition is a classical combinatorial optimization problem and has a lot of application. Based on the application in finite element methods, linear programming and VLSI, balanced partition problem on big order graphs (at least million vertices) is arose. Since the NP-Hardness and largescale, researchers have presented some heuristic algorithms based on multilevel method to solve this problem. In this talk, I will take the popular graph partition software package METIS as an example to introduce multilevel method, and discuss some future works.
个人简介: 李宪越，兰州大学数学与统计*女王调教-女王调教视频-女王 调教小说副教授，硕士生导师。主要从事组合优化、近似算法设计与分析和图论及其应用的研究。中国运筹学会数学规划分会第七届理事会(2018-2022)青年理事、组合图论分会第五届理事会(2019-2023)青年理事。2016-2018 年，连续三年担任了国家自然科学基金委员会数学天元基金全国“组合优化”研究生暑期学校助教。在 Journal of Global Optimization，IEEE/ACM Transactions on Networking，IEEE Transactions on Mobile Computing，IEEE Transactions on Services Computing，Journal of Combinatorial Optimization，Discrete Applied Mathematics，IEEE INFOCOM 等相关领域权威期刊和顶级会议上发表学术论文近 30 篇。主持国家自然科学基金青年基金1项、数学天元青年基金1项、军工项目2项。主要承担运筹学、图论等本科生课程及组合最优化、近似算法、图论等研究生课程。