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

Authors:
M. Colebrook;J. Gutiérrez;J. Sicilia
Affiliations:
Departamento de Estadística, Investigación Operativa y Computación, Facultad de Matemáticas, Universidad de La Laguna, Av. Astrofísico F. Sánchez s/n, 38271-La Laguna ...;Departamento de Estadística, Investigación Operativa y Computación, Facultad de Matemáticas, Universidad de La Laguna, Av. Astrofísico F. Sánchez s/n, 38271-La Laguna ...;Departamento de Estadística, Investigación Operativa y Computación, Facultad de Matemáticas, Universidad de La Laguna, Av. Astrofísico F. Sánchez s/n, 38271-La Laguna ...
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 2

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Information Processing Letters
Improved complexity bounds for center location problems on networks by using dynamic data structures

SIAM Journal on Discrete Mathematics
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
An O(mn) algorithm for the 1-maximin problem on a network

Computers and Operations Research
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Algorithm 63: partition

Communications of the ACM

Computing a maxian point of a simple rectilinear polygon

Operations Research Letters
Efficient location and allocation strategies for undesirable facilities considering their fundamental properties

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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.