Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: An Algorithm for Large Zero-One Knapsack Problems / 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: Inverse median location problems with variable coordinates / 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: The inverse Fermat-Weber problem / 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: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pioneering Developments in Location Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861561 / 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: A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / 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: Reverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eccentric vertex problem on networks / 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: An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions / rank
 
Normal rank

Revision as of 00:07, 21 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
scientific article

    Statements

    Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    location problem
    0 references
    inverse optimization problem
    0 references
    1-center problem
    0 references
    tree
    0 references
    0 references
    0 references
    0 references

    Identifiers