Title: On Network Design with Stochastic Arc Capacities. Speaker: Avinash Bhardwaj, UC Berkeley Time and date: 3:00 pm, Friday Jan 17 2014 Venue: Room 217, Mechanical Engineering Abstract: 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. Speaker Bio: Avinash is a Ph.D. candidate in the department of Industrial Engineering and Operations Research at the University of California, Berkeley. Prior to commencing his graduate studies, Avinash pursued his undergraduate studies at IIT Delhi, and graduated as a part of Class of 2008. His research interests broadly span the areas of conic integer programming, robust optimization, polyhedral cutting planes for mixed-integer programming and superadditive lifting techniques.
News Category