DocumentCode :
480006
Title :
Nonmetric Multicommodity Facility Location and K-Median Problem with Service Installation Costs
Author :
Xing, DongMei
Author_Institution :
Dept. of Comput. Sci. & Eng., Fudan Univ., Nanchang
Volume :
3
fYear :
2008
fDate :
12-14 Dec. 2008
Firstpage :
264
Lastpage :
269
Abstract :
We studied the multicommodity facility location and a variant K-median problem as well. For the first problem, the pure combinatory strategies are presented. We give a subtle analysis for the nonmetric uncapacitated case and an approximation algorithm for the capacitated case. For the first time, the local search technique is exploited in the variant K-median problem with service installation and an 3+ epsiv-approximation ratio (epsi : 0 < epsi les 1) is achieved. Our results of the second problem is under the assumption that there is an ordering on the facilities. If i´ comes after i in this ordering, then for any commodity (also named service type) the initial service costs in i is not higher than the costs in i´.
Keywords :
combinatorial mathematics; computational complexity; costing; facility location; search problems; approximation algorithm; combinatorial strategy; local search technique; nonmetric multicommodity facility location problem; service installation cost; variant k-median problem; Algorithm design and analysis; Approximation algorithms; Computer science; Cost function; Magnetic flux leakage; Mathematics; Operations research; Software engineering; Urban planning; Virtual manufacturing; K-median; approximation; facility location; local search;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-0-7695-3336-0
Type :
conf
DOI :
10.1109/CSSE.2008.1460
Filename :
4722337
Link To Document :
بازگشت