|
|
 |
|
Mardi 12 Mai
| Heure: |
11:00 - 14:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Various aspects of automaton synchronization |
| Description: |
Mikhael Berlinkov |
| Heure: |
12:30 - 13:30 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
EXACT APPROACHES TO THE NETWORK DESIGN PROBLEM WITH RELAYS |
| Description: |
Ivana Ljubic This work considers the Network Design Problem with Relays (NDPR). The
NDPR arises in the context of network design when given node-pairs need
to communicate with each other, but, due to signal deterioration,
communication paths have to respect given distance limits. To cover
longer distances, equipment for signal regeneration (i.e., relays) may
be required. To enable required communications, one has to upgrade the
network: by installing new links, by installing relays on the existing
network, or by a combination of both. Besides applications in network
design, the NDPR arises in the context of e-mobility where relays model
charging stations for electric cars and edge costs correspond to road
tolls.
In contrast to previous work on the NDPR, which was mainly focused on
heuristic approaches, we propose new exact approaches based on different
mixed integer linear programming formulations for the problem. We
develop Branch-and-Price and Branch-Price-and-Cut algorithms that build
upon models with an exponential number of constraints and variables. In
a computational study, we analyze the performance of these approaches
for instances with different characteristics.
This is a joint work with M. Leitner, M. Riedler and M. Ruthmair |
| Heure: |
14:00 - 17:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Énumération d'automates minimaux et fonctions de parking |
| Description: |
Jean-Baptiste Priez |
|
|
