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
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- A linear time algorithm for the reverse 1‐median problem on a cycle
- An Algorithm for Large Zero-One Knapsack Problems
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Approximation algorithms for certain network improvement problems
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Improving the location of minisum facilities through network modification
- Increasing the Weight of Minimum Spanning Trees
- Inverse p-median problems with variable edge lengths
- Inverse median problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Modifying edges of a network to obtain short subgraphs
- Reverse 2-median problem on trees
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
- The network inhibition problem
- Up- and downgrading the 1-center in a network
Cited in
(10)- Some upgrading problems on networks related to eccentricity concept
- Edge downgrades in the maximal covering location problem
- Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading edges in the maximal covering location problem
- Stability radius and an upgrading model of median location on trees
- Upgrading min-max spanning tree problem under various cost functions
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- 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)
