Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EOR
2007
79views more  EOR 2007»
10 years 2 months ago
The directional p
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
EOR
2010
84views more  EOR 2010»
10 years 2 months ago
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
Lian Qi, Zuo-Jun Max Shen
ANOR
2007
58views more  ANOR 2007»
10 years 3 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
10 years 6 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
10 years 8 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
books