The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction

DOI10.1007/s10013-021-00529-0zbMath1512.90057OpenAlexW3205651790MaRDI QIDQ6159691

Kien Trung Nguyen, Wen Chean Teh

Publication date: 8 May 2023

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-021-00529-0

zbMATH Keywords

location problemcombinatorial optimizationreverse optimizationcentdian function

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• Improving the location of minisum facilities through network modification
• Foundations of location analysis
• Algorithms for connected \(p\)-centdian problem on block graphs
• Reverse 2-median problem on trees
• Up- and downgrading the 1-center in a network
• Some reverse location problems
• Reverse selective obnoxious center location problems on tree graphs
• Upgrading the 1-center problem with edge length variables on a tree
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
• Heuristic approaches for solid transportation-\(p\)-facility location problem
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Long-term load forecasting: models based on MARS, ANN and LR methods
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
• Reverse 1-center problem on weighted trees
• Fuzzy prediction strategies for gene-environment networks – Fuzzy regression analysis for two-modal regulatory systems
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Improving the location of minimax facilities through network modification
• A polynomial algorithm for thep-centdian problem on a tree
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance
• A linear time algorithm for the reverse 1‐median problem on a cycle

This page was built for publication: The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction