Sciweavers

193 search results - page 6 / 39
» Solving the multiple competitive facilities location problem
Sort
View
GRID
2007
Springer
13 years 7 months ago
A Local Facility Location Algorithm for Large-scale Distributed Systems
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
Denis Krivitski, Assaf Schuster, Ran Wolff
EOR
2007
82views more  EOR 2007»
13 years 7 months ago
The equitable location problem on the plane
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang
ICCV
2009
IEEE
15 years 15 days ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
WSC
1997
13 years 8 months ago
Solving Engine Maintenance Capacity Problems with Simulation
For many companies the scheduling of job shops proves very difficult. Competing priorities (due dates, potential profit) from multiple customers confronts the plant manager with m...
Robert Gatland, Eric Yang, Kenneth Buxton
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy