Upgrading p-median problem on a path

DOI10.1007/S10852-014-9265-9zbMATH Open1327.90028OpenAlexW2110856202MaRDI QIDQ894530FDOQ894530

Ali Reza Sepasian, F. 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

Recommendations

• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
• Up- and downgrading the 1-center in a network
• Upgrading min-max spanning tree problem under various cost functions
• Upgrading the 1-center problem with edge length variables on a tree
• scientific article; zbMATH DE number 1163718

zbMATH Keywords

facility location\(p\)-median problemparameter modificationupgrading problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• 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 edges in the maximal covering location problem
• Upgrading min-max spanning tree problem under various cost functions
• On the complexity of the upgrading version of the maximal covering location problem

This page was built for publication: Upgrading \(p\)-median problem on a path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894530)