This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...