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

DOI10.1016/S0305-0548(03)00238-7zbMath1068.68169OpenAlexW2115029649MaRDI QIDQ1885943

Joaquín Sicilia, Marcos Colebrook, José Miguel Gutiérrez

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00238-7

zbMATH Keywords

Network locationMaxian problemUndesirable (noxious/obnoxious) facility

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Computing a maxian point of a simple rectilinear polygon ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem

Uses Software

• LEDA
• Find

Cites Work

• Unnamed Item
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Analytical models for locating undesirable facilities
• An \(O(mn)\) algorithm for the 1-maximin problem on a network
• A note on the location of an obnoxious facility on a network
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Obnoxious Facility Location on Graphs
• A new algorithm for the undesirable 1-center problem on networks
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks