Reverse selective obnoxious center location problems on tree graphs (Q1650850): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-017-0624-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2770978752 / 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: 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: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria in Competitive Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / 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: Reverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dual minimum cost flow algorithms / 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

Revision as of 02:58, 16 July 2024

scientific article
Language Label Description Also known as
English
Reverse selective obnoxious center location problems on tree graphs
scientific article

    Statements

    Reverse selective obnoxious center location problems on tree graphs (English)
    0 references
    0 references
    0 references
    13 July 2018
    0 references
    obnoxious center location
    0 references
    combinatorial optimization
    0 references
    reverse optimization
    0 references
    time complexity
    0 references

    Identifiers

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