{"id":706,"date":"2021-05-19T16:17:14","date_gmt":"2021-05-19T16:17:14","guid":{"rendered":"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=706"},"modified":"2021-05-19T16:18:41","modified_gmt":"2021-05-19T16:18:41","slug":"optimization-seminar-series-friday-may-21-2021","status":"publish","type":"post","link":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=706","title":{"rendered":"Optimization Seminar Series &#8211; Friday May 21, 2021 @ 11 am MDT"},"content":{"rendered":"<p>Speaker: Oluwaseun (Francis) Lijoka<br \/>\nDate: May 21, 2021 (Friday)<br \/>\nTime:  11:00 AM<\/p>\n<p>Join Zoom Meeting<br \/>\n<a href=\"https:\/\/uleth.zoom.us\/j\/95769298984?pwd=eUhRMVIzT1ZYV3FZR0NWL1JHcHFqUT09\">https:\/\/uleth.zoom.us\/j\/95769298984?pwd=eUhRMVIzT1ZYV3FZR0NWL1JHcHFqUT09<\/a><\/p>\n<p>Meeting ID: 957 6929 8984<br \/>\nPasscode: 985604<\/p>\n<p>Title: Capacity Provisioning on Dynamic Path Network<br \/>\nAbstract: The aim of the talk is to  introduce the problem of allocating capacities to edges of a dynamic path network with n vertices, in such a way that the evacuation completion time towards a single sink node (minmax criterion) is minimized. Our algorithm determines the optimal assignment of capacities to all edges of the network from a given total budget under the assumption that the location of the sink is known. In perspective with other evacuation and sink location problems, our model is suitable for planning the evacuation of remote and sparsely populated areas.  Uncovered properties and vital data structures will be discussed.<\/p>\n<p>Everyone is welcome.<\/p>\n<p>Bio: Francis is a PhD student in the Optimization Research Group in our department. We all know Francis, don&#8217;t we?<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Oluwaseun (Francis) Lijoka Date: May 21, 2021 (Friday) Time: 11:00 AM Join Zoom Meeting https:\/\/uleth.zoom.us\/j\/95769298984?pwd=eUhRMVIzT1ZYV3FZR0NWL1JHcHFqUT09 Meeting ID: 957 6929 8984 Passcode: 985604 Title: Capacity Provisioning on Dynamic Path Network Abstract: The aim of the talk is to introduce the &hellip; <a href=\"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=706\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14],"tags":[],"class_list":["post-706","post","type-post","status-publish","format-standard","hentry","category-news"],"_links":{"self":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/706","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=706"}],"version-history":[{"count":4,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/706\/revisions"}],"predecessor-version":[{"id":710,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/706\/revisions\/710"}],"wp:attachment":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=706"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=706"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=706"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}