"In this talk, the speaker will present mathematical models and efficient solution algorithms for dynamic and robust capacitated facility location problems. The total demand of customers is assumed to be time varying over a discrete and finite time horizon, and can be split or served by one or more facilities. There are fixed costs associated with establishing, operating, and closing facilities. Also, there is a variable transportation cost for serving the customers’ demand. The main objective is to find an optimal sequence for locating facilities to satisfy the time varying demand while observing the capacity restrictions.

Check out events Page for information about more events!