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

DOI10.1155/2013/313868zbMATH Open1296.90131OpenAlexW1992262116WikidataQ59025939 ScholiaQ59025939MaRDI QIDQ460433FDOQ460433

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

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

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
• Title not available (Why is that?)
• 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)