The inverse 1-median problem on tree networks with variable real edge lengths (Q460433): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Zhang, Jianhua / rank
Normal rank
 
Property / author
 
Property / author: Qin Wang / rank
Normal rank
 

Revision as of 21:12, 9 February 2024

scientific article
Language Label Description Also known as
English
The inverse 1-median problem on tree networks with variable real edge lengths
scientific article

    Statements

    The inverse 1-median problem on tree networks with variable real edge lengths (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2014
    0 references
    Summary: Location problems exist in the real world and they mainly deal with finding optimal locations for facilities in a network, such as net servers, hospitals, and shopping centers. The inverse location problem is also often met in practice and has been intensively investigated in the literature. As a typical inverse location problem, the inverse 1-median problem on tree networks with variable real edge lengths is discussed in this paper, which is to modify the edge lengths at minimum total cost such that a given vertex becomes a 1-median of the tree network with respect to the new edge lengths. First, this problem is shown to be solvable in linear time with variable nonnegative edge lengths. For the case when negative edge lengths are allowable, the NP-hardness is proved under Hamming distance, and strongly polynomial time algorithms are presented under \(l_1\) and \(l_\infty\) norms, respectively.
    0 references

    Identifiers