Classical and inverse median location problems under uncertain environment
From MaRDI portal
Publication:1987593
DOI10.1007/s10255-020-0945-0zbMath1436.90074OpenAlexW3016077628MaRDI QIDQ1987593
Behrooz Alizadeh, Fahimeh Baroughi, Akram Soltanpour
Publication date: 15 April 2020
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-020-0945-0
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse 1-median problem on block graphs with variable vertex weights
- New heuristic algorithms for solving the planar \(p\)-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- Inverse 1-median problem on trees under weighted Hamming distance
- Uncertain models for single facility location problems on networks
- Inverse \(p\)-median problems with variable edge lengths
- Foundations of location analysis
- The big cube small cube solution method for multidimensional facility location problems
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
- A projection method for \(l_ p\) norm location-allocation problems
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- Covering location problem of emergency service facilities in an uncertain environment
- Inverse median problems
- 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
- Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
- The capacitated facility location-allocation problem under uncertain environment
- Inverse 1-median Problem on Trees under Weighted l ∞ Norm
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A squared-euclidean distance location-allocation problem
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Heuristic Methods for Location-Allocation Problems
- 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
- 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
- Uncertainty theory
This page was built for publication: Classical and inverse median location problems under uncertain environment
