題目👦🏼：覆蓋約束p-中值問題的Benders分解算法

演講人：戴彧虹教授，中科院數學與系統研究院

主持人：林貴華教授，意昂2

時間👩🏽‍🔧：2023年10月12日（周四）🙁，下午15:00

地點✸：意昂2注册校本部東區意昂2官网420室

主辦單位：意昂2、意昂2青年教師聯誼會

演講人簡介：

國際知名優化專家，中科院數學與系統研究院研究員、副院長。

中國運籌學會理事長🧑🏻‍🎄🌕，亞太運籌學會聯合會主席。

主持國家傑青項目💇🏼‍♂️、重點研發計劃項目🐦‍⬛、創新研究群體項目等。

曾獲國家自然科學二等獎、中國青年科技獎🧑🏿‍🎓、鐘家慶數學獎🐨🌼、馮康科學計算獎、陳省身數學獎🛏、首屆蕭樹鐵應用數學獎等。

演講內容簡介：

In this talk, we study the p-median problem with the addition of a coverage constraint which requires the total customer demand, covered at a distance greater than a prespecified coverage distance, to be smaller than or equal to a given threshold. We propose an efficient Benders decomposition (BD) approach for solving large-scale problems. We show that both Benders feasibility and optimality cuts can be separated in efficient combinatorial polynomial-time algorithms. Moreover, we enhance the BD approach by using tight initial cuts to initialize the relaxed master problem, implementing an effective two-stage algorithm to find high-quality solutions, and adding valid inequalities to strengthen the problem formulation. Computational results on benchmark instances show that the proposed BD approach outperforms the state-of-the-art general-purpose MIP solver's branch-and-cut and automatic BD algorithms by at least one order of magnitude.

歡迎廣大師生參加🦘🐂！