Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128869792, #quickstatements; #temporary_batch_1724872475876
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2902466745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms / 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: Optimal algorithms for inverse vertex obnoxious center location problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median location problems with variable coordinates / 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 \(p\)-maxian problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / 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: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of location analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-maxian problem with edge length modification / 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: 2-balanced flows and the inverse 1-median problem in the Chebyshev space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on block graphs with variable vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model for the inverse 1-median problem on trees under uncertain costs / 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: The inverse \(p\)-maxian problem on trees with variable edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse center location problem on a tree / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128869792 / rank
 
Normal rank

Latest revision as of 00:49, 29 August 2024

scientific article
Language Label Description Also known as
English
Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
scientific article

    Statements

    Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    obnoxious \(p\)-median location
    0 references
    combinatorial optimization
    0 references
    inverse optimization
    0 references
    time complexity
    0 references
    tree networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references