Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows
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.
In this thesis we consider two optimal routing problems in networks. Both are NP-hard and are often used to modelize real life problems of large size. We first present the capacitated arc routing problem (CARP). In this problem, we have to serve a set of c ...
We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...
The invention concerns a wireless data communication method, wherein a transmitter device (2) having a first broadband antenna (27) transmits ultra wideband coded data signals to a receiver device (3) having a second broadband antenna (37) for receiving th ...
To assess the daylighting performances of a building, one of the most commonly used quantities is the Daylight factor, which is defined for a given surface element inside the analysed room as the ratio of the inside and outside illuminances under a CIE ove ...
