Results 261 to 270 of about 76,976 (306)

The Online Connected Facility Location Problem

open access: yes, 2014
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online version of the Connected Facility Location problem (CFL). The CFL is a combination of the Uncapacitated Facility Location problem (FL) and the Steiner Tree problem (ST).
Mário César San Felice   +2 more
openaire   +2 more sources

Altruism in Facility Location Problems

International Joint Conference on Autonomous Agents and Multiagent Systems, 2023
We study the facility location problems (FLPs) with altruistic agents who act to benefit others in their affiliated groups. Our aim is to design mechanisms that elicit true locations from the agents in different overlapping groups and locate a facility to serve agents to approximately optimize a given objective based on agents' costs to the facility ...
Houyu Zhou, Hau Chan, Minming Li
openaire   +2 more sources

Facility’s Perspective to Fair Facility Location Problems

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
We study the problem faced by a decision maker who wants to locate a set of facilities on a real line and allocate agents/items to the facilities. The items have given locations on the line, and can only be assigned to one of their closest facilities. The facilities are controlled by managers, who have additive utility over the items.
Chenhao Wang 0001   +3 more
openaire   +1 more source

On Constrained Facility Location Problems

Journal of Computer Science and Technology, 2008
Given m facilities each with an opening cost, n demands, and distance between every demand and facility, the Facility Location problem flnds a solution which opens some facilities to connect every demand to an opened facility such that the total cost of the solution is minimized.
Wei-Lin Li, Peng Zhang 0008, Daming Zhu
openaire   +1 more source

The Facility Location Problem with Limited Distances

Transportation Science, 1991
In this paper we consider minisum and minimax single facility location problems where the effective service distance becomes a constant when the actual distance attains or exceeds a certain value. Properties of these problems are studied, and algorithms for their solution are presented.
Zvi Drezner   +2 more
openaire   +1 more source

The Kinetic Facility Location Problem

2008
We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the accumulated cost for the whole point set is at most a constant factor larger than the optimal cost.
Bastian Degener   +2 more
openaire   +1 more source

Reverse facility location problems. [PDF]

open access: possible, 2005
info:eu-repo/semantics ...
Cabello, Sergio   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy