Improving the location of minimax facilities through network modification

DOI10.1002/net.3230240105zbMath0799.90074OpenAlexW1980481441MaRDI QIDQ4291483

Divinagracia I. Ingco, Amedeo R. Odoni, Oded Berman

Publication date: 24 November 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240105

zbMATH Keywords

networkheuristicnetwork locationminimax objectivelocation of additional facilities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (26)

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Inverse median problems ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Minimising maximum response time ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ The reverse selective balance center location problem on trees ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Unnamed Item ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ The inverse 1-maxian problem with edge length modification ⋮ Reverse 2-median problem on trees ⋮ The center location improvement problem under the Hamming distance ⋮ Reverse 1-center problem on weighted trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Some reverse location problems ⋮ Assigning weights to minimize the covering radius in the plane ⋮ A further study on inverse linear programming problems

This page was built for publication: Improving the location of minimax facilities through network modification