Upgrading \(p\)-median problem on a path

DOI10.1007/s10852-014-9265-9zbMath1327.90028OpenAlexW2110856202MaRDI QIDQ894530

Ali Reza Sepasian, Freydoon Rahbarnia

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-014-9265-9

zbMATH Keywords

\(p\)-median problemfacility locationparameter modificationupgrading problem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Upgrading edges in the maximal covering location problem ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation

Cites Work

• Unnamed Item
• Inverse \(p\)-median problems with variable edge lengths
• Improving the location of minisum facilities through network modification
• Reverse 2-median problem on trees
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Up- and downgrading the 1-center in a network
• Modifying edges of a network to obtain short subgraphs
• Approximation algorithms for certain network improvement problems
• Inverse median problems
• An Algorithm for Large Zero-One Knapsack Problems
• Maximizing the minimum source-sink path subject to a budget constraint
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Increasing the Weight of Minimum Spanning Trees
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• The network inhibition problem
• A linear time algorithm for the reverse 1‐median problem on a cycle