A concentration inequality for the facility location problem
نویسندگان
چکیده
We give a concentration inequality for stochastic version of the facility location problem. show objective Cn=minF?[0,1]2?|F|+?x?Xminf?F??x?f? is concentrated in an interval length O(n1/6) and E[Cn]=?(n2/3) if input X consists i.i.d. uniform points unit square. Our main tool to use geometric quantity, previously used design approximation algorithms problem, analyze martingale process. Many our techniques generalize other settings.
منابع مشابه
Sequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملA Congested Facility Location Problem
Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are repo...
متن کاملA Fast Algorithm for Facility Location Problem
In this paper, we present an approximation algorithm achieving approximation guarantee of 2 for the classical uncapacitated facility location problem. The distinguishing feature of our designed algorithm is the overall low running time of ( log ) O m m , where c f m n n = × , c n and f n are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the run...
متن کاملA Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2022
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2022.01.009