Reverse 1-maxian problem with keeping existing 1-median
From MaRDI portal
Publication:1735954
DOI10.1007/s12597-018-0348-7OpenAlexW2907647432WikidataQ128647813 ScholiaQ128647813MaRDI QIDQ1735954
Publication date: 29 March 2019
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-018-0348-7
Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial optimization (90C27) Operations research and management science (90Bxx)
Related Items (4)
Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ 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
Cites Work
- Inverse 1-median problem on block graphs with variable vertex weights
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Improving the location of minisum facilities through network modification
- Discrete location problems with push-pull objectives
- The inverse 1-maxian problem with edge length modification
- Reverse 2-median problem on trees
- The inverse 1-median problem on a cycle
- Some reverse location problems
- Reverse selective obnoxious center location problems on tree graphs
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Inverse median problems
- Reverse 1-center problem on weighted trees
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Improving the location of minimax facilities through network modification
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- A linear time algorithm for the reverse 1‐median problem on a cycle
This page was built for publication: Reverse 1-maxian problem with keeping existing 1-median
