Concept
Arbre couvrant de poids minimal
Publications associées (211)
A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem
We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...
Piscataway2024Decomposition method to evaluate district heating/cooling network potential at urban scale
François Maréchal, Luc Girardin, Ana Catarina Gouveia Braz, Bingqian Liu, Raphaël Briguet
In this work, a tool to design district heating networks (DHN) is presented and applied to the city of Lausanne as a case study. The evaluation of the buildings’ heat/cooling demand is performed using a Geographic Information System (GIS) database, built f ...
Associazione Italiana Di Ingegneria Chimica2024Approximation Algorithms for Allocation and Network Design
In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...
EPFL2023