An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

DOI10.1080/02331934.2013.783033zbMath1308.90028OpenAlexW1543319916MaRDI QIDQ4981873

Ali Reza Sepasian, Freydoon Rahbarnia

Publication date: 20 March 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.783033

zbMATH Keywords

facility locationinverse optimization1-median problem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (26)

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ 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 ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading \(p\)-median problem on a path ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ The reverse selective balance center location problem on trees ⋮ On some inverse 1-center location problems ⋮ 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 ⋮ Classical and inverse median location problems under uncertain environment ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Reverse 1-center problem on weighted 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 ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ 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 ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• Inverse \(p\)-median problems with variable edge lengths
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse median problems
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions