282 search results - page 13 / 57 » Approximation algorithms for facility location problems |
EOR
2007
15 years 1 months ago
2007
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
132
click to vote
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
115
click to vote
IPCO
2001
15 years 2 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
141
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
117
click to vote
ICNSC
2008
IEEE
15 years 7 months ago
2008
IEEE
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...