Related papers: Optimal location problems with routing cost
The growth in the number of users in mobile communications networks and the rise in the traffic generated by each user, are responsible for the increasing importance of Mobility Management. Within Mobility Management, the main objective of…
Multi-marginal optimal transport (MOT) is a generalization of optimal transport to multiple marginals. Optimal transport has evolved into an important tool in many machine learning applications, and its multi-marginal extension opens up for…
Hub location problems are central to optimizing logistics, telecommunications, and transportation networks by consolidating flows through strategically placed hubs. While existing models assume symmetric allocation, where hubs handle…
We consider emergent situations that require transporting individuals from their locations to a facility using a single capacitated vehicle, where transportation duration has a negative impact on the individuals. A dispatcher determines…
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of the problem where the cost of comparing two elements is a…
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing…
We consider a given region $\Omega$ where the traffic flows according to two regimes: in a region $C$ we have a low congestion, where in the remaining part $\Omega\setminus C$ the congestion is higher. The two congestion functions $H_1$ and…
Metaheuristics are known to be strong in solving large-scale instances of computationally hard problems. However, their efficiency still needs exploration in the context of instance structure, scale and numerical properties for many of…
We present an iterative method to efficiently solve the optimal transportation problem for a class of strictly convex costs which includes quadratic and p-power costs. Given two probability measures supported on a discrete grid with n…
We consider a multimarginal transport problem with repulsive cost, where the marginals are all equal to a fixed probability $\rho \in \mathcal{P}(\mathbb{R}^d)$. We prove that, if the concentration of $\rho$ is less than $1/N$, then the…
In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…
We study optimal transport for stationary stochastic processes taking values in finite spaces. In order to reflect the stationarity of the underlying processes, we restrict attention to stationary couplings, also known as joinings. The…
This paper studies the problem of scheduling urban air mobility trips when travel times are uncertain and capacity at destinations is limited. Urban air mobility, in which air transportation is used for relatively short trips within a city…
The optimal transport problem has many applications in machine learning, physics, biology, economics, etc. Although its goal is very clear and mathematically well-defined, finding its optimal solution can be challenging for large datasets…
Discrete optimal transportation problems arise in various contexts in engineering, the sciences and the social sciences. Often the underlying cost criterion is unknown, or only partly known, and the observed optimal solutions are corrupted…
We introduce and investigate properties of a variant of the semi-discrete optimal transport problem. In this problem, one is given an absolutely continuous source measure and cost function, along with a finite set which will be the support…
Optimal transport (OT) is a powerful geometric and probabilistic tool for finding correspondences and measuring similarity between two distributions. Yet, its original formulation relies on the existence of a cost function between the…
In this paper, we study a dynamic pickup and delivery problem with docking constraints. There is a homogeneous fleet of vehicles to serve pickup-and-delivery requests at given locations. The vehicles can be loaded up to their capacity,…
In this paper, we study locating charging station problem as facility location problem and its variants ($k$-Median, $k$-Facility location and $k$-center). We study the connectivity and the capacity constraints in these problem. Capacity…
This paper addresses the problem of locating base stations in a certain area which is highly populated by mobile stations; each mobile station is assumed to select the closest base station. Base stations are modeled by players who choose…