Results 171 to 180 of about 2,658 (212)
Some of the next articles are maybe not open access.
Facility location with hierarchical facility costs
ACM Transactions on Algorithms, 2006We introduce a facility location problem with submodular facility cost functions, and give an O (log n ) approximation algorithm for it. Then we focus on a special case of submodular costs, called hierarchical facility costs, and give a (4.237 + ϵ)-approximation algorithm using local search ...
Zoya Svitkina, Éva Tardos
openaire +2 more sources
Online Facility Location with Mobile Facilities
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018We examine the Online Facility Location Problem in an augmented version, where the online algorithm is allowed to adapt the position of the facilities for costs proportional to the distance by which the position is changed. In this setting, it is possible to construct online algorithms which deal with the lower bound instances of Online Facility ...
Björn Feldkord +1 more
openaire +1 more source
Multicommodity Facility Location
2018Multicommodity facility location refers to the extension of facility location to allow for different clients having demand for different goods, from among a finite set of goods. This leads to several optimization problems, depending on the costs of opening facilities (now a function of the commodities it serves).
R. Ravi 0001, Amitabh Sinha
openaire +2 more sources
Facility Location Choice and Facility Location Planning
2014Der Jubilar, Professor Dr. Dr. h.c. mult. Hans-Jurgen Zimmermann, dem dieser Festband gewidmet ist, hat sich fur die Standorte Darmstadt, Berlin, Urbana-Champaign, Aachen, Brussel und Turku als Eckpfeiler seiner akademischen und unternehmerischen Laufbahn entschieden.
Sabrina Bangert +2 more
openaire +1 more source
The Location of Emergency Service Facilities
Operations Research, 1971This paper views the location of emergency facilities as a set covering problem with equal costs in the objective. The sets are composed of the potential facility points within a specified time or distance of each demand point. One constraint is written for each demand point requiring “cover,” and linear programming is applied to solve the covering ...
Constantine Toregas +3 more
openaire +2 more sources
Location of Multiple Obnoxious Facilities
Transportation Science, 1985This problem deals with the location of facilities that are obnoxious in the sense that nearness of the facility to fixed points, which may represent population centers or other installations, is undesirable. Two model formulatons are given. In the first formulation we minimize the maximum weighted distance in the system subject to constraints which ...
Zvi Drezner, George O. Wesolowsky
openaire +2 more sources
Location of Service Facilities for the Elderly
Annals of Operations Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael P. Johnson +2 more
openaire +2 more sources
Obnoxious Facility Location on Graphs
SIAM Journal on Discrete Mathematics, 1991Summary: This paper discusses new complexity results for several models dealing with the location of obnoxious or undesirable facilities on graphs. The focus is mainly on the continuous \(p\)-Maximin and \(p\)-Maxisum dispersion models, where the facilities can be established at the nodes or in the interiors of the edges.
openaire +2 more sources
Noncooperative facility location games
Operations Research Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources