The inverse 1-median problem on tree networks with variable real edge lengths

DOI10.1155/2013/313868zbMath1296.90131OpenAlexW1992262116WikidataQ59025939 ScholiaQ59025939MaRDI QIDQ460433

Joonwhoan Lee, Longshu Wu, Qin Wang, Zhang, Jianhua

Publication date: 13 October 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/313868

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Upgrading edges in the maximal covering location problem ⋮ Unnamed Item ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse \(p\)-median problems with variable edge lengths
• Modeling of biological intelligence for SCM system optimization
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• The stochastic \(p\)-median problem with unknown cost probability distribution
• Inapproximability and a polynomially solvable special case of a network improvement problem.
• A network improvement problem under different norms
• Computation of the reverse shortest-path problem
• The network \(p\)-median problem with discrete probabilistic demand weights
• The shortest path improvement problems under Hamming distance
• Inverse median problems
• Incremental medians via online bidding
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

This page was built for publication: The inverse 1-median problem on tree networks with variable real edge lengths