A network improvement problem under different norms

DOI10.1023/B:COAP.0000013061.17529.79zbMath1061.90010OpenAlexW2072630120MaRDI QIDQ1430275

Zhang, Jianzhong, Xiao-guang Yang, Mao-cheng Cai

Publication date: 27 May 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000013061.17529.79

zbMATH Keywords

location probleminapproximabilitystrongly polynomial algorithmsnetwork improvement problems

Mathematics Subject Classification ID

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

Related Items (8)

Optimizing budget allocation for center and median points ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ Reverse 2-median problem on trees ⋮ The optimization of road building schedule based on budget restriction ⋮ The center location improvement problem under the Hamming distance ⋮ Complexity of some inverse shortest path lengths problems ⋮ Up- and downgrading the 1-center in a network ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

This page was built for publication: A network improvement problem under different norms