Improving the location of minisum facilities through network modification
From MaRDI portal
Publication:689226
DOI10.1007/BF02060467zbMath0787.90035MaRDI QIDQ689226
Divinagracia I. Ingco, Amedeo R. Odoni, Oded Berman
Publication date: 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (31)
Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Design of a location and transportation optimization model including quality of service using constrained multinomial logit ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse median problems ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Upgrading \(p\)-median problem on a path ⋮ Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study ⋮ 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 ⋮ Improving spanning trees by upgrading nodes ⋮ 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 inverse 1-median problem on a cycle ⋮ On the optimum capacity of capacity expansion problems ⋮ Upgrading bottleneck constrained forests ⋮ The inverse Fermat-Weber problem ⋮ Reverse 1-center problem on weighted trees ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ Modifying edges of a network to obtain short subgraphs ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Some reverse location problems ⋮ A further study on inverse linear programming problems ⋮ Improving spanning trees by upgrading nodes
Cites Work
This page was built for publication: Improving the location of minisum facilities through network modification
