Undesirable facility location problems on multicriteria networks
- 1 May 2007
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 34 (5), 1491-1514
- https://doi.org/10.1016/j.cor.2005.06.010
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networksComputers & Operations Research, 2005
- A new algorithm for the undesirable 1-center problem on networksJournal of the Operational Research Society, 2002
- A note on the location of an obnoxious facility on a networkEuropean Journal of Operational Research, 2000
- An O(mn) Algorithm for the 1-maximin problem on a networkComputers & Operations Research, 1999
- Obnoxious Facility Location on GraphsSIAM Journal on Discrete Mathematics, 1991
- Analytical models for locating undesirable facilitiesEuropean Journal of Operational Research, 1989
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data StructuresSIAM Journal on Discrete Mathematics, 1988
- A Linear-Time Algorithm for Maxisum Facility Location on Tree NetworksTransportation Science, 1984
- Anticenters and antimedians of a networkNetworks, 1983
- Locating an Obnoxious Facility on a NetworkTransportation Science, 1978