The multi-facility median problem with Pos/Neg weights on general graphs

Authors:
Jörg Kalcsics
Affiliations:
Institute of Operations Research, Karlsruhe Institute of Technology, Karlsruhe, Germany
Venue:
Computers and Operations Research
Year:
2011

Citing 8
Cited 1

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
On the conditional p-median problem

Computers and Operations Research
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
2-medians in trees with pos/neg weights

Discrete Applied Mathematics
Improved algorithms for several network location problems with equality measures

Discrete Applied Mathematics
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

Unreliable point facility location problems on networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we discuss the multi-facility location problem on networks with positive and negative weights. As the finite dominating set for the single facility problem does not carry over to the multi-facility problem, we derive a new finite dominating set. To solve the problem, we present a straight-forward algorithm. Moreover, for the problem with just two new facilities, we show how to obtain a more efficient solution procedure by using planar arrangements. We present computational results to underline the efficiency of the improved algorithm and to test some approximations which are based on a reduced candidate set.