3656 search results - page 10 / 732 » Compact Location Problems |
COR
2004
13 years 8 months ago
2004
Abstract. A heuristic method for solving large-scale multi
ALGORITHMICA
2004
13 years 8 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
CCCG
2008
13 years 10 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
COR
2008
13 years 8 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
ANOR
2002
13 years 8 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...