Publications associées à Problème d'affectation

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 ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Maryam Kamgarpour, Tony Alan Wood

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Michel Bierlaire

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

2023

Adaptive Symplectic Model Order Reduction Of Parametric Particle-Based Vlasov-Poisson Equation

Jan Sickmann Hesthaven, Nicolò Ripamonti, Cecilia Pagliantini

. High-resolution simulations of particle-based kinetic plasma models typically require a high number of particles and thus often become computationally intractable. This is exacerbated in multi-query simulations, where the problem depends on a set of para ...

AMER MATHEMATICAL SOC2023

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

EPFL2022

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Knowledge-Aware Cross-Modal Text-Image Retrieval for Remote Sensing Images

Devis Tuia, Christel Marie Tartini-Chappuis, Li Mi, Siran Li

Image-based retrieval in large Earth observation archives is difficult, because one needs to navigate across thousands of candidate matches only with the proposition image as a guide. By using text as a query language, the retrieval system gains in usabili ...

2022

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

Optimal target assignment for massive spectroscopic surveys

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian

Robotics have recently contributed to cosmological spectroscopy to automatically obtain the map of the observable universe using robotic fiber positioners. For this purpose, an assignment algorithm is required to assign each robotic fiber positioner to a t ...

2020

Enhanced Dissipation in the Navier-Stokes Equations Near the Poiseuille Flow

Klaus Martin Widmayer

We consider solutions to the 2d Navier-Stokes equations on T x R close to the Poiseuille flow, with small viscosity nu > 0. Our first result concerns a semigroup estimate for the linearized problem. Here we show that the x-dependent modes of linear solutio ...

SPRINGER2020

Scalable Semidefinite Programming

Volkan Cevher, Alp Yurtsever

Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage an ...

2021

Energy-based comparison between the Fourier-Galerkin method and the finite element method

Thomas Willem Jan de Geus

The Fourier-Galerkin method (in short FFTH) has gained popularity in numerical homogenisation because it can treat problems with a huge number of degrees of freedom. Because the method incorporates the fast Fourier transform (FFT) in the linear solver, it ...

ELSEVIER2020

Stationary Structures near the Kolmogorov and Poiseuille Flows in the 2d Euler Equations

Klaus Martin Widmayer

We study the behavior of solutions to the incompressible 2d Euler equations near two canonical shear flows with critical points, the Kolmogorov and Poiseuille flows, with consequences for the associated Navier-Stokes problems. We exhibit a large family of ...

2020

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Boi Faltings, Panayiotis Danassis

The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...

IOS PRESS2020

Optimum design of low environmental impact structures through component reuse

Jan Friedrich Georg Brütting

Load-bearing systems (structures) in buildings and infrastructure contribute to a significant share of adverse environmental impacts (EI) because of resource- and energy-intensive fabrication. A currently overlooked circular economy strategy to reduce EI i ...

EPFL2020

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020