Combining robustness and recovery for airline schedules
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.
The solution of inverse problems in cardiovascular mathematics is computationally expensive. In this paper we apply a domain parametrization technique to reduce both the geometrical and computational complexity of the forward problem, and replace the finit ...
Modeling work in neuroscience can be classified using two different criteria. The first one is the complexity of the model, ranging from simplified conceptual models that are amenable to mathematical analysis to detailed models that require simulations in ...
This thesis is devoted to the design and analysis of algorithms for scheduling problems. These problems are ubiquitous in the modern world. Examples include the optimization of local transportation, managing access to concurrent resources like runways at a ...
This paper presents a systematic approach for the synthesis of the heat recovery network in total site using a Mixed Integer Linear Programming model. This model returns a near-to-optimal network configuration with minimum utility cost while allows to sele ...
Decision making and planning for which the state information is only partially available is a problem faced by all forms of intelligent entities they being either virtual, synthetic or biological. The standard approach to mathematically solve such a decisi ...
We consider quadratic stochastic programs with random recourse—a class of problems which is perceived to be computationally demanding. Instead of using mainstream scenario tree-based techniques, we reduce computational complexity by restricting the space o ...
We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various cons ...
A common problem in spatial statistics is to predict a random field f at some spatial location t(0) using observations f(t(1)),..., f(t(n)) at t(1),..., t(n) epsilon IRd. Recent work by Kaufman et al. and Furrer et al. studies the use of tapering for reduc ...
This dissertation describes a complete methodological framework for designing, modeling and optimizing a specific class of distributed systems whose dynamics result from the multiple, stochastic interactions of their constitutive components. These componen ...
Most infrastructure in the western world was built in the second half of the 20th century. Transportation structures, water distribution networks and energy production systems are now aging and this leads to safety and serviceability issues. In situations ...
