碧桂园政经名家大讲堂——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
讲座人：
陈伟坤
形式：
校区：
兴庆校区
实践学分：
讲座内容：
报告题目： 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.
相关视频