碧桂园政经名家大讲堂——Exact separation algorithm for unsplittable capacitated network design flow arc-set polyhedron

讲座名称: 碧桂园政经名家大讲堂——Exact separation algorithm for unsplittable capacitated network design flow arc-set polyhedron
讲座时间 2019-12-19
讲座地点 中国西部科技创新港5号楼(5-8088)
讲座人 陈伟坤
讲座内容

报告题目: Exact separation algorithm for unsplittable capacitated network design flow arc-set polyhedron
报告时间:2019年12月19日(星期四)上午9:30-11:00
报告地点:中国西部科技创新港5号楼(5-8088)
报告人:陈伟坤
报告摘要:
Many practical problems arising in real world applications, mainly in the fields of logistics and telecommunications, can be modeled as unsplittable capacitated network design problem. In this talk, we consider the flow arc-set polyhedron of this problem. By analyzing the property of its nontrivial facet, we design an exact algorithm to solve the associated separation problem such that the constructed inequality guarantees to be facet-defining. To speed up this approach, we present a closed form of the separation problem under some conditions. Furthermore, a new technique is presented to accelerate the exact separation algorithm, which significantly decreases the number of iterations in the algorithm. Finally, a comprehensive computational study on the unsplittable capacitated network design problem is presented to demonstrate the effectiveness of the proposed algorithm.

 

讲座人介绍

陈伟坤,北京理工大学特别副研究员。2014年本科毕业于中山大学数学与计算科学学院,2019年在中国科学院数学与系统科学研究院获得博士学位。博士期间,受中国科学院大学资助访问德国Zuse Institute Berlin一年(合作导师:Thorsten Koch教授)。毕业后,他就职于北京理工大学数学与统计学院。他的主要研究兴趣是整数规划算法与应用,相关的研究成果发表在《IEEE Journal on Selected Areas in Communications》,《Journal of Global Optimization》,《Science China Mathematics》等期刊上。2018年获得中国运筹学会颁发的“科学技术奖运筹应用奖”,2019年获得中国数学会计算数学分会颁发的优秀青年论文二等奖。

讲座视频 暂无视频

(转载文章,请注明出处: 西安交通大学学术资源平台 http://meeting.xjtu.edu.cn)

如果您有学术信息和动态,欢迎投稿,wuxuan@mail.xjtu.edu.cn。我们将在第一时间确认并收录