Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete facility location and routing of obnoxious activities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-center location problems with edge length augmentation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on trees under weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minimax facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eccentric vertex problem on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some reverse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse center location problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for inverse obnoxious center location problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minisum facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the reverse 1‐median problem on a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 2-median problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse \(p\)-median problems with variable edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-median problem on a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-maxian problem with edge length modification / rank
 
Normal rank

Latest revision as of 03:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Linear time optimal approaches for reverse obnoxious center location problems on networks
scientific article

    Statements

    Linear time optimal approaches for reverse obnoxious center location problems on networks (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2016
    0 references
    obnoxious center location
    0 references
    reverse optimization
    0 references
    combinatorial optimization
    0 references
    time complexity
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references