Robust Optimization with Recovery: Application to Shortest Paths and Airline Scheduling
Related publications (39)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
This paper argues that for the study and facilitation of collaborative learning, existing theories of grounding such as that of Clark and Shaefer [5] cannot be applied without adjustments. When comparing collaborative learning and conversation, four dimens ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
The present work is related to the recent research topics in hydrology devoted to the integration of field knowledge into the hydrological modelling. The study catchment is the Haute-Mentue experimental basin (12.5 km2) located in western Switzerland, in t ...
We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...
When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...
In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simp ...
This thesis, based on a project realised in cooperation with Électricité de France (EDF), proposes a new concept for a Decision Aid Function FOr Restoration (DAFFOR) of transmission power systems after a blackout. DAFFOR is an interactive computer tool whi ...