Inverse median problems
From MaRDI portal
Publication:2386211
DOI10.1016/j.disopt.2004.03.003zbMath1087.90038OpenAlexW2050773466MaRDI QIDQ2386211
Carmen Pleschiutschnig, Rainer E. Burkard, Zhang, Jianzhong
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.003
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Inverse problems in optimal control (49N45)
Related Items (76)
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ 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 ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Inverse eccentric vertex problem on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance ⋮ Mathematical models for the variable weights version of the inverse minimax circle location problem ⋮ The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ 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 ⋮ A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Unnamed Item ⋮ A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm ⋮ Upgrading edges in the maximal covering location problem ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading \(p\)-median problem on a path ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ An inverse approach to convex ordered median problems in trees ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ 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 ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Unnamed Item ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ On some inverse 1-center location problems ⋮ Resource allocation in rooted trees for VLSI applications ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ The inverse 1-maxian problem with edge length modification ⋮ Reverse 2-median problem on trees ⋮ Inverse quickest center location problem on a tree ⋮ Classical and inverse median location problems under uncertain environment ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ The minmax regret inverse maximum weight problem ⋮ The inverse 1-median problem on a cycle ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ Discrete optimization: an Austrian view ⋮ The inverse Fermat-Weber problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reverse 1-center problem on weighted trees ⋮ 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 min-max spanning r-arborescence problem under the weighted sum-type Hamming distance ⋮ The continuous knapsack problem with capacities ⋮ Up- and downgrading the 1-center in a network ⋮ An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees ⋮ A HYBRID ALGORITHM FOR THE UNCERTAIN INVERSE p-MEDIAN LOCATION PROBLEM
Cites Work
- Improving the location of minisum facilities through network modification
- On an instance of the inverse shortest paths problem
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- Improving the location of minimax facilities through network modification
- Unnamed Item
- Unnamed Item
This page was built for publication: Inverse median problems
