Sciweavers

52 search results - page 2 / 11
» Supporting the Search for the Optimal Location of Facilities
Sort
View
COR
2011
13 years 2 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
DCOSS
2005
Springer
14 years 27 days ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 7 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
JSAC
2010
122views more  JSAC 2010»
13 years 5 months ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis
CP
2005
Springer
14 years 27 days ago
Parallel Local Search in Comet
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
Laurent Michel, Pascal Van Hentenryck