Concept

Problème du voyageur de commerce

Publications associées (682)

Modeling and optimization of dedicated bus lanes space allocation in large networks with dynamic congestion

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Dedicated bus lanes provide a low cost and easily implementable strategy to improve transit service by minimizing congestion-related delays. Identifying the best spatial distribution of bus-only lanes in order to maximize traffic performance of an urban ne ...

2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

Analytical Computation of Power Grids’ Sensitivity Coefficients with Voltage-Dependent Injections

Mario Paolone, Sherif Alaa Salaheldin Fahmy

With the increasing need of real-time regulation in power systems, grid-aware-control-frameworks are relying more often on sensitivity coefficients (SCs) to formulate and efficiently solve optimal control problems. As known, SCs are the derivatives of cont ...

IEEE2021

Computational methods for live heart imaging with speed-constrained microscopes

Olivia Mariani

Imaging methods to capture the beating and developing heart inside embryonic animal models such as the zebrafish are a key component for the study of fundamental biological processes such as cardiac birth defects or tissue regeneration. However, live heart ...

EPFL2021

Computational tool for stock-constrained design of structures

Corentin Jean Dominique Fivet, Jonas Warmuth, Jan Friedrich Georg Brütting

Designing structures from reused elements is becoming an increasingly important design task for structural engineers as it has potential to significantly reduce adverse environmental impacts of building structures. To allow for a broad application of this ...

2021

A multi-hop control scheme for traffic management

Kenan Zhang

We propose a multi-hop control scheme (MHCS) that aims to route traffic through a set of designated intermediate checkpoints (ICs). Because travelers are allowed to freely choose routes for each “hop” that connects real (origin and destination) and ICs, MH ...

2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing times, release time ...

ASSOC COMPUTING MACHINERY2021

Federated Learning Over Wireless Networks: Convergence Analysis and Resource Allocation

Vincent Gramoli

There is an increasing interest in a fast-growing machine learning technique called Federated Learning (FL), in which the model training is distributed over mobile user equipment (UEs), exploiting UEs' local computation and training data. Despite its advan ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Coordinating Distributed Energy Resources and Utility-Scale Battery Energy Storage System for Power Flexibility Provision Under Uncertainty

Mohsen Kalantar Neyestanaki

Relying on the power flexibility of distributed energy resources (DERs) located in an active distribution network (ADN), this ADN will be able to provide power flexibility to the upper-layer grid at their point of common coupling (PCC). The power flexibili ...

2021

Fast Projection Onto Convex Smooth Constraints

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on projection problems where ...

PMLR2021

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search