The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
From MaRDI portal
Publication:320084
DOI10.1016/j.ejor.2015.06.064zbMath1346.90712OpenAlexW804266806MaRDI QIDQ320084
André B. Chassein, Kien Trung Nguyen
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.064
Related Items (21)
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ The minmax regret inverse maximum weight problem ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse group 1-median problem on trees ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
Cites Work
- Unnamed Item
- Unnamed Item
- An inverse approach to convex ordered median problems in trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse \(p\)-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
- Inverse 1-center location problems with edge length augmentation on trees
- The complexity analysis of the inverse center location problem
- Algorithmic results for ordered median problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Location Theory
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Pioneering Developments in Location Analysis
- The \(k\)-centrum multi-facility location problem
This page was built for publication: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
