Optimal algorithms for selective variants of the classical and inverse median location problems on trees
From MaRDI portal
Publication:5238068
DOI10.1080/10556788.2018.1482296zbMath1423.90130OpenAlexW2811311140MaRDI QIDQ5238068
Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi
Publication date: 28 October 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1482296
Programming involving graphs or networks (90C35) Continuous location (90B85) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (6)
Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
Uses Software
Cites Work
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse 1-median problem on trees under weighted Hamming distance
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Inverse \(p\)-median problems with variable edge lengths
- Inverse median location problems with variable coordinates
- Foundations of location analysis
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
- Improved complexity bounds for location problems on the real line
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- A bibliography for some fundamental problem categories in discrete location science
- Inverse median problems
- Median problems on wheels and cactus graphs
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- A model for the inverse 1-median problem on trees under uncertain costs
- Solution methods for thep-median problem: An annotated bibliography
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Computing the 2‐median on tree networks in O(n lg n) time
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- Location Science
- Inverse Maximum Flow Problems under the Combining Norms
- Algorithms – ESA 2005
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal algorithms for selective variants of the classical and inverse median location problems on trees
