Related papers: Easy Capacitated Facility Location Problems, with …
We consider a problem where agents have private positions on a line, and public approval preferences over two facilities, and their cost is the maximum distance from their approved facilities. The goal is to decide the facility locations to…
Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study…
Algorithms with predictions have attracted much attention in the last years across various domains, including variants of facility location, as a way to surpass traditional worst-case analyses. We study the $k$-facility location mechanism…
We consider the weighted completion time minimization problem for capacitated parallel machines, which is a fundamental problem in modern cloud computing environments. We study settings in which the processed jobs may have varying duration,…
Many multiobjective real-world problems, such as facility location and bus routing, become more complex when optimizing the priorities of multiple stakeholders. These are often modeled using infinite classes of objectives, e.g., $L_p$ norms…
We study a truthful two-facility location problem in which a set of agents have private positions on the line of real numbers and known approval preferences over two different facilities. Given the locations of the two facilities, the cost…
In this paper we propose an extension of the Uncapacitated Hub Location Problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We…
The classic online facility location problem deals with finding the optimal set of facilities in an online fashion when demand requests arrive one at a time and facilities need to be opened to service these requests. In this work, we study…
In this paper, we propose a constrained heterogeneous facility location model where a set of alternative locations are feasible for building facilities and the number of facilities built at each location is limited. Supposing that a set of…
We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set $S$ of commodities. Ravi and Sinha (SODA'04) introduced the model as the…
The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore,…
We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness 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…
The growth of e-commerce has created increasing complexity in logistics services. To remain competitive, logistics and e-commerce companies are exploring new modes as supplements to traditional home delivery, one of which is the…
We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the two facilities. The single-facility variant of this problem…
In this focused technical paper, we present long-awaited algorithmic advances toward the efficient construction of near-optimal replenishment policies for a true inventory management classic, the economic warehouse lot scheduling problem.…
Logistics network is expected that opened facilities work continuously for a long time horizon without any failure, but in real world problems, facilities may face disruptions. This paper studies a reliable joint inventory location problem…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
In typical applications of facility location problems, the location of demand is assumed to be an input to the problem. The demand may be fixed or dynamic, but ultimately outside the optimizers control. In contrast, there are settings,…
Capacitated fair-range $k$-clustering generalizes classical $k$-clustering by incorporating both capacity constraints and demographic fairness. In this setting, each facility has a capacity limit and may belong to one or more demographic…