On Network Design with Stochastic Arc Capacities.Algebra & Discrete Mathematics
|Speaker:||Avinash Bhardwaj, Univ. of California, Berkeley|
|Start time:||Mon, Apr 21 2014, 12:10PM|
In this work, we present robust models to determine minimum cost network setup(s) while considering a fixed charge network flow problem with particular attention to the stochastic nature of the arc capacities. We study the associated submodular knapsack constraint set and derive strong valid inequalities for the convex hull of the integer feasible solutions. We provide extension and lifting algorithms to obtain the facets of the convex hull, whilst also deriving sequence independent bounds on the lifting coefficients.
contact Matthias Koeppe