Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: 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: Inverse 1-center location problems with edge length augmentation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time optimal approaches for reverse obnoxious center location problems on networks / 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: Discrete facility location and routing of obnoxious activities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ottimizzazione Combinatoria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4007808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eccentric vertex problem 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: 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: Q4367080 / 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: Some reverse location problems / rank
 
Normal rank

Latest revision as of 20:51, 14 July 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for inverse vertex obnoxious center location problems on graphs
scientific article

    Statements

    Optimal algorithms for inverse vertex obnoxious center location problems on graphs (English)
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    obnoxious center location
    0 references
    combinatorial optimization
    0 references
    inverse optimization
    0 references
    time complexity
    0 references

    Identifiers