The inverse \(p\)-maxian problem on trees with variable edge lengths

DOI10.11650/TJM.20.2016.6296zbMath1357.90023arXiv1504.02830OpenAlexW2962898584MaRDI QIDQ515099

Pham Thi Vui, Kien Trung Nguyen

Publication date: 9 March 2017

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

Full work available at URL: https://arxiv.org/abs/1504.02830

zbMATH Keywords

treelocation problemHamming distanceinverse optimization\(p\)-maxian

Mathematics Subject Classification ID

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

Related Items (11)

Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees

This page was built for publication: The inverse \(p\)-maxian problem on trees with variable edge lengths