Undesirable facility location with minimal covering objectives
نویسندگان
چکیده
منابع مشابه
Non-cooperative Facility Location and Covering Games
We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a...
متن کاملObnoxious facility location: Complete service with minimal harm
We present e cient algorithms for several instances of the following facility location problem. (Facilities and demand sites are represented as points in the plane.) Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must con...
متن کاملReliable Capacitated Facility Location Problem Considering Maximal Covering
This paper provides a framework in order to incorporate reliability issue as a sign of disruption in distribution systems and partial covering theory as a response to limitation in coverage radios and economical preferences, simultaneously into the traditional literatures of capacitated facility location problems. As a result we develop a bi-objective model based on the discrete scenarios for e...
متن کاملDynamic Facility Location with Stochastic Demand
Determination of facilities, such as factories or warehouses, location and availability conditions is one of the important and strategic decisions for an organization to make. Transportation costs that form a major part of goods price are dependent to this decision making. There are verity of methods have been presented to achieve the optimal locations of these facilities which are generally de...
متن کاملOnline Covering with Convex Objectives and Applications
We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon et al., STOC 2003) and online covering with offline packing constraints (Azar et al., SODA 2013). To the best of our knowledge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1999
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00335-x