The online electric autonomous dial-a-ride problem
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 observe imaging through windows comprising pairs of confocal lenslet arrays that have different focal lengths but that are otherwise identical. Image space is stretched in the longitudinal direction only. Such windows are examples of METATOYs, optical c ...
In this paper we validate the Lidar-Radiometer Inversion Code (LIRIC) retrievals of the aerosol concentration in the fine mode, using the airborne aerosol chemical composition dataset obtained over the Greater Athens Area (GAA) in Greece, during the ACEMED ...
Heart rate variability (HRV) is non-invasive and commonly used for monitoring responses to training loads, fitness, or overreaching in athletes. Yet, the recording duration for aseries of RR-intervals varies from 1 to 15 min in the literature. The aim of t ...
Ordinary residential buildings dating from late nineteenth century and early twentieth century are an essential part of the European urban built environment. Today, it is important to address the comfort of residents through renovations improving the build ...
Green Lines Institute for Sustainable Development2016
This paper analyses and compares different policy scenarios as well as discusses price elasticities and willingness to pay and to accept using revealed preference data from the French new-car market in 2014 by means of a cross-nested logit (CNL) model. We ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...
The complexity of evaluating chance constraints makes chance-constrained programming problem difficult to solve. One way to handle this complexity is by devising satisficing measures for the relevant uncertainties. This paper focuses on solving the stochas ...
We present the results of searches for high-energy muon neutrinos from 41 gamma-ray bursts (GRBs) in the northern sky with the IceCube detector in its 22 string configuration active in 2007/2008. The searches cover both the prompt and a possible precursor ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles' capacity and customer time windows. ...
The major objectives of this paper are: (1) to review the pros and cons of the scenarios of past anthropogenic land cover change (ALCC) developed during the last ten years, (2) to discuss issues related to pollen-based reconstruction of the past land-cover ...
