Inverse 1-median Problem on Trees under Weighted l ∞ Norm

DOI10.1007/978-3-642-14355-7_16zbMath1286.90082OpenAlexW1508976878MaRDI QIDQ3578369

Xiucui Guan, Binwu Zhang

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_16

zbMATH Keywords

treebinary searchinverse 1-median problemweighted \(l _{ \infty }\) norm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Classical and inverse median location problems under uncertain environment ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective

This page was built for publication: Inverse 1-median Problem on Trees under Weighted l  ∞  Norm