Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
From MaRDI portal
Publication:2158608
DOI10.1007/s10479-020-03561-4zbMath1493.90089OpenAlexW3010912433MaRDI QIDQ2158608
Fahimeh Baroughi, Behrooz Alizadeh, Esmaeil Afrashteh
Publication date: 26 July 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03561-4
combinatorial optimizationtime complexitytree graphsupgrading problemobnoxious \(p\)-median location
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for inverse obnoxious center location problems on networks
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Upgrading \(p\)-median problem on a path
- The inverse 1-maxian problem with edge length modification
- Up- and downgrading the 1-center in a network
- Inverse 1-center location problems with edge length augmentation on trees
- Modifying edges of a network to obtain short subgraphs
- Approximation algorithms for certain network improvement problems
- Weight reduction problems with certain bottleneck objectives.
- Discrete facility location and routing of obnoxious activities.
- Reverse selective obnoxious center location problems on tree graphs
- Upgrading the 1-center problem with edge length variables on a tree
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- The \(p\)-maxian problem on a tree
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- 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
- Upgrading trees under diameter and budget constraints
- Increasing the Weight of Minimum Spanning Trees
