BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IORA - Institute of Operations Research and Analytics - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IORA - Institute of Operations Research and Analytics
X-ORIGINAL-URL:https://iora.nus.edu.sg
X-WR-CALDESC:Events for IORA - Institute of Operations Research and Analytics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:+08
DTSTART:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20220225T100000
DTEND;TZID=Asia/Singapore:20220225T113000
DTSTAMP:20260407T125134
CREATED:20211216T014656Z
LAST-MODIFIED:20220221T025401Z
UID:14701-1645783200-1645788600@iora.nus.edu.sg
SUMMARY:IORA Seminar Series - Yehua Wei
DESCRIPTION:Yehua Wei is an Associate Professor in the Decision Sciences area at Fuqua School of Business. He received his Ph.D. in Operations Research from MIT in 2013. His research interest can be broadly defined as decisions under uncertainty\, including optimization problems on operational and strategical levels. More recently\, he has been working on topics in dynamic resource allocation\, vehicle routing\, strategic routing\, and e-commerce fulfillment. \n\n\n\nName of Speaker\n  Wei Yehua\n\n\nSchedule\n 25 February 2022\, 10am – 11.30am \n(60 min talk + 30 min Q&A) \n\n\nLink to register\nhttps://nus-sg.zoom.us/meeting/register/tZctdOmorjIjGdUto_SJO3EzN_kdorcJyJVr\n\n\nTitle\n Approximate Submodularity in Network Design\n\n\nAbstract\nNetwork design problems are ubiquitous in long term planning for modern marketplaces\, where firms constantly innovate new ways to match supply and demand. They are often challenging to solve due to the problem scale and the uncertainties that affect the decisions. In this talk\, we establish a novel structural property for a large class of network design problems. The property can be interpreted as an approximate form of submodularity\, where local changes in the objective function can be used to bound global changes. We use this structure to analyze simple heuristics and establish theoretical guarantees for network design problems in e-retailing\, online market platforms\, and manufacturing. Further\, using our analysis\, we identify new heuristics for solving network design problems that lead to an order of magnitude gains in computational efficiency\, without loss of optimization performance. This is a joint work with Levi DeValve (Chicago) and Sasa Pekec (Duke).
URL:https://iora.nus.edu.sg/events/iora-seminar-series-yehua-wei/
CATEGORIES:IORA Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://iora.nus.edu.sg/wp-content/uploads/2021/12/Pic-Wei-YH.jpg
END:VEVENT
END:VCALENDAR