Reverse 1-center problem on weighted trees
From MaRDI portal
Publication:2790878
DOI10.1080/02331934.2014.994626zbMath1332.90052MaRDI QIDQ2790878
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.994626
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90B80: Discrete location and assignment
Related Items
Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems, Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms, Further Study on Reverse 1-Center Problem on Trees, Some polynomially solvable cases of the inverse ordered 1-median problem on trees, Reverse 1-centre problem on trees under convex piecewise-linear cost function, Unnamed Item, The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights, The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction, The reverse selective balance center location problem on trees, The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance, 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, Reverse 1-maxian problem with keeping existing 1-median, Inverse quickest center location problem on a tree, Solving the absolute 1-center problem in the quickest path case, A survey of network interdiction models and algorithms, Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees, Inverse and reverse balanced facility location problems with variable edge lengths on trees, The cardinality constrained inverse center location problems on tree networks with edge length augmentation, A model for the inverse 1-median problem on trees under uncertain costs, Linear time optimal approaches for reverse obnoxious center location problems on networks
Cites Work
- A linear time algorithm for inverse obnoxious center location problems on networks
- Inverse \(p\)-median problems with variable edge lengths
- Inverse median location problems with variable coordinates
- Improving the location of minisum facilities through network modification
- Foundations of location analysis
- Reverse 2-median problem on trees
- Some reverse location problems
- Inverse median problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- 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
- A linear time algorithm for the reverse 1‐median problem on a cycle
