A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks

A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks

0.00 Avg rating—0 Votes
Article ID: iaor20052048
Country: United Kingdom
Volume: 32
Issue: 2
Start Page Number: 309
End Page Number: 325
Publication Date: Feb 2005
Journal: Computers and Operations Research
Authors: , ,
Keywords: networks
Abstract:

The problem of locating an undesirable facility on a network with n nodes and m edges so as to maximize its total weighted distance to all nodes is addressed. We propose a new upper bound to the problem. Likewise, we develop a new algorithm in O(mn) time which dynamically updates this new upper bound. Computational results on low and high dense networks, as well as planar networks, are presented.

Reviews

Required fields are marked *. Your email address will not be published.