Results 211 to 220 of about 288,897 (259)
Some of the next articles are maybe not open access.
Strategyproof Facility Location with Limited Locations
Journal of the Operations Research Society of China, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhong-Zheng Tang +3 more
openaire +1 more source
Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bastian Degener +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bastian Degener +2 more
openaire +2 more sources
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, 2005
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves an O(√k(mρ)1/√klog(m+n)) approximation in O(k ...
Thomas Moscibroda, Roger Wattenhofer
openaire +3 more sources
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves an O(√k(mρ)1/√klog(m+n)) approximation in O(k ...
Thomas Moscibroda, Roger Wattenhofer
openaire +3 more sources
Journal of the Operational Research Society, 1978
In this paper, we consider a modification of the Weber problem which consists of locating a new facility on a sphere so that the weighted sum of distances to given demand points is minimized. Two ways of measuring distance are used. One is simply the length of shortest arc on the sphere.
Drezner, Z., Wesolowsky, G. O.
openaire +2 more sources
In this paper, we consider a modification of the Weber problem which consists of locating a new facility on a sphere so that the weighted sum of distances to given demand points is minimized. Two ways of measuring distance are used. One is simply the length of shortest arc on the sphere.
Drezner, Z., Wesolowsky, G. O.
openaire +2 more sources
2003
In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility ...
Mohammad Mahdian, Martin Pál
openaire +2 more sources
In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility ...
Mohammad Mahdian, Martin Pál
openaire +2 more sources
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
2016
Transportation is one of the main contributing factors of global carbon emissions, and thus, when dealing with facility location models in a distribution context, transportation emissions may be substantially higher than the emissions due to production or storage.
Velázquez Martínez, J.C. +1 more
openaire +1 more source
Transportation is one of the main contributing factors of global carbon emissions, and thus, when dealing with facility location models in a distribution context, transportation emissions may be substantially higher than the emissions due to production or storage.
Velázquez Martínez, J.C. +1 more
openaire +1 more source
On the Location of Hub Facilities
Transportation Science, 1988Hub Location problems have attracted considerable attention recently. In this note the multihub location problem is formulated and the condition under which a destination is optimally assigned to a hub facility is developed.
openaire +1 more source
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 +2 more sources
Online facility location with facility movements
Central European Journal of Operations Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabriella Divéki, Csanád Imreh
openaire +3 more sources