Stochastic Set Cover with Submodular Penalties and Prize-Collecting Steiner Tree Problem

主 講 人 ：張曉巖    

活動(dòng)時(shí)間：12月31日19時(shí)00分    

地      點(diǎn) ：理科群1號樓D204 騰訊會議: 962 224 144

講座內(nèi)容：

We concern two distinct stochastic combinatorial optimization problems. The first is the Stochastic Set Cover problem with Submodular Penalties, which involves selecting sets to cover a given ground set under uncertainty, with the additional complexity of submodular penalties for selecting certain sets. The second problem is the stochastic Prize-Collecting Steiner Tree Problem, which aims to find a cost-effective subtree that connects a specified set of terminals in a graph, while also collecting prizes associated with non-terminal nodes, balancing the trade-off between edge costs and prize collection. Both problems present unique challenges and require sophisticated algorithmic approaches to find near optimal solutions.

主講人介紹：

張曉巖，先后在南開大學(xué)和荷蘭特文特大學(xué)獲得應(yīng)用數(shù)學(xué)和理論計(jì)算機(jī)科學(xué)方向博士學(xué)位，南京師范大學(xué)數(shù)學(xué)科學(xué)學(xué)院及數(shù)學(xué)研究所教授、博士生導(dǎo)師，統(tǒng)計(jì)學(xué)博士后合作導(dǎo)師，中科院深圳先進(jìn)技術(shù)研究院數(shù)字所高性能計(jì)算中心客座研究員，入選江蘇省六大人才高峰高層次人才，入選江蘇省智庫青年人才計(jì)劃，入選國家重大人才領(lǐng)軍計(jì)劃，中國運(yùn)籌學(xué)圖論與組合分會常務(wù)理事，中國運(yùn)籌學(xué)數(shù)學(xué)規(guī)劃分會理事，中國運(yùn)籌學(xué)算法軟件與應(yīng)用分會理事，中國工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會圖論組合及應(yīng)用專委會理事、中國計(jì)算機(jī)學(xué)會理論計(jì)算機(jī)科學(xué)專業(yè)委員會執(zhí)行委員，德國波恩大學(xué)離散數(shù)學(xué)研究所、英國倫敦大學(xué)皇家霍洛威學(xué)院合作訪問教授，主要從事圖與組合優(yōu)化、統(tǒng)計(jì)優(yōu)化及理論計(jì)算機(jī)科學(xué)的研究工作，研究成果發(fā)表在《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》和《IEEE TRANSACTIONS ON INFORMATION THEORY》等國際著名學(xué)術(shù)期刊，著有英文學(xué)術(shù)論著兩部及譯著一部。

發(fā)布時(shí)間：2024-12-26 15:07:39