报告题目1：Metaheuristics for large scale combinatorial optimization

报告题目2：Learning and data mining driven optimization for combinatorial search problems: some case studies

报 告 人：Jin-Kao Hao

报告时间1：2018年4月18日（星期三）上午10:00-11:30

报告时间2：2018年4月19日（星期四）上午10:00-11:30

报告地点：老校部二楼大会议室

邀 请 人：工业与系统工程研究所 唐立新教授

Abstract 1: Combinatorial optimization aims to determine among a finite set of candidate solutions a particular solution that satisfies a minimization or maximization criterion. Combinatorial optimization is difficult in the general case (NP-hard problems). In addition to classical methods of exact solution, approximate approaches based on metaheuristics have emerged over the past twenty years as an alternative to overcome the intrinsic complexity of combinatorial problems. In this talk, we first offer an overview of the typical metaheuristic methods. We then present some examples of applications on well-known NP-difficult problems (coloring of graphs, multidimensional knapsack, maximum clique ...) and real problems (frequency planning and antenna positioning in radio networks, planning of satellite photography, sports league scheduling...).

Abstract 2: In this talk we present some case studies of using learning and data mining techniques for solving combinatorial optimization problems: multidimensional scaling and reinforcement learning for graph coloring, opposition-based learning for subset selection with maximum diversity, and frequent patterns for quadratic assignment. We show how learning and data mining techniques can be advantageously combined with an optimization method to obtain high-quality solutions for difficult combinatorial optimization problems.

Resume：Dr. Jin-Kao Hao holds the title of Distinguished Professor at the Computer Science Department of the University of Angers (France) and is Senior Fellow of the Institut Universitaire de France. He headed the LERIA Lab. from 2003 until 2015. His research lies in the design of effective algorithms and intelligent computational methods for solving large-scale combinatorial search problems. He is interested in various application areas including bioinformatics, data science, telecommunication, complex networks, and transportation. He has published some 220 papers including over 110 SCI journal papers and co-edited 9 books in Springer’s LNCS series. He has served on some 200 Program Committees of International Conferences and is on the Editorial Board of 7 International Journals. His Google Scholar H-index (till March 2017) is 44 with over 7100 citations.