Related papers: Exact Approaches for Competitive Facility Location…
We show how to restrict the analysis of a class of online problems that includes the $k$-server problem in finite metrics such that we only have to consider finite sequences of request. When applying the restrictions, both the optimal…
Nowadays, several crowdsourcing projects exploit social choice methods for computing an aggregate ranking of alternatives given individual rankings provided by workers. Motivated by such systems, we consider a setting where each worker is…
Facility location problems aim to identify the best locations to set up new services. Majority of the existing works typically assume that the users are static. However, there exists a wide array of services such as fuel stations, ATMs,…
We study different restricted variations of the obnoxious facility location problem on a plane. The first is the constrained obnoxious facility location on a line segment (COFL-Line) problem. We provide an efficient algorithm for this…
The metric capacitated facility location is a well-studied problem for which, while constant factor approximations are known, no efficient relaxation with constant integrality gap is known. The question whether there is such a relaxation is…
In this paper we initiate the study of the heterogeneous capacitated $k$-center problem: given a metric space $X = (F \cup C, d)$, and a collection of capacities. The goal is to open each capacity at a unique facility location in $F$, and…
We study a constrained distributed heterogeneous two-facility location problem, where a set of agents with private locations on the real line are divided into disjoint groups. The constraint means that the facilities can only be built in a…
This paper addresses an integrated lot-sizing and scheduling problem in the industry of consumer goods for personal care, a very competitive market in which the good customer service level and the cost management show up in the competition…
In this paper, we investigate a class of non-convex sum-of-ratios programs relevant to decision-making in key areas such as product assortment and pricing, and facility location and cost planning. These optimization problems, characterized…
We establish and analyze a service center location model with a simple but novel decision-dependent demand induced from a maximum attraction principle. The model formulations are investigated in the distributionally-robust optimization…
We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Swamy & Shmoys. To the…
We present a solution for a two-phase facility planning scenario where in the first phase, there is some flexibility in determining where the locations of facilities (or sources) should fall. And in the second phase, new waypoints (or…
In this paper we study the facility location problem in the online with recourse and dynamic algorithm models. In the online with recourse model, clients arrive one by one and our algorithm needs to maintain good solutions at all time steps…
Constrained competitive optimization involves multiple agents trying to minimize conflicting objectives, subject to constraints. This is a highly expressive modeling language that subsumes most of modern machine learning. In this work we…
We study the problem of designing procurement auctions for the strategic uncapacitated facility location problem: a company needs to procure a set of facility locations in order to serve its customers and each facility location is owned by…
The single row facility layout problem (SRFLP) is a well-studied NP-hard combinatorial optimization problem with applications in manufacturing and logistics systems. In the SRFLP, a set of facilities with lengths is given, as well as…
In this paper we consider multiple constrained resource allocation problems, where the constraints can be specified by formulating activity dependency restrictions or by using game-theoretic models. All the problems are focused on generic…
The uncapacitated facility location has always been an important problem due to its connection to operational research and infrastructure planning. Byrka obtained an algorithm that is parametrized by $\gamma$ and proved that it is optimal…
This paper presents a heuristic approach for solving the placement of Analog and Mixed-Signal Integrated Circuits. Placement is a crucial step in the physical design of integrated circuits. During this step, designers choose the position…
Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical…