A new algorithm for the undesirable 1-center problem on networks

DOI10.1057/palgrave.jors.2601468zbMath1139.90424OpenAlexW1972850002WikidataQ29027358 ScholiaQ29027358MaRDI QIDQ4656761

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

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601468

zbMATH Keywords

locationnetworks and graphsundesirable (noxious/obnoxious) facility

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks ⋮ Undesirable facility location problems on multicriteria networks ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem

This page was built for publication: A new algorithm for the undesirable 1-center problem on networks