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

DOI10.1155/2013/313868MaRDI QIDQ460433zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• Inverse p-median problems with variable edge lengths
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• An \(\mathcal{O}(n \log n)\) 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
• The inverse 1-median problem on a tree and on a path

Cites work

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

Cited in

(13)

• Inverse anti-k-centrum problem on networks with variable edge lengths
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• An inverse approach to convex ordered median problems in trees
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse p-median problems with variable edge lengths
• Upgrading edges in the maximal covering location problem
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• A modified particle swarm optimization algorithm for general inverse ordered \(p\)-median location problem on networks
• scientific article; zbMATH DE number 7709522 (Why is no real title available?)
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460433)