Sciweavers

284 search results - page 29 / 57
» Profit-earning facility location
Sort
View
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 10 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
CSCWD
2006
Springer
14 years 1 months ago
Collaborative Multidisciplinary Design in Virtual Environments
The application designers can usually define their own "virtual environments" by selecting the appropriate computing resources required, or reuse and compose existing en...
Toan Nguyen, Vittorio Selmin
COR
2006
88views more  COR 2006»
13 years 10 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
COR
2007
99views more  COR 2007»
13 years 9 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
TCS
2008
13 years 9 months ago
The 2-radius and 2-radiian problems on trees
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
Hung-Lung Wang, Kun-Mao Chao