Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130106036, #quickstatements; #temporary_batch_1726327587925
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Combinatorial algorithms for inverse absolute and vertex 1-center location problems 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: 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: Inverse median problems / 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: Foundations of location analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse approach to convex ordered median problems in trees / 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: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for ordered median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance / 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: 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: 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: 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: The \(k\)-centrum multi-facility location problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130106036 / rank
 
Normal rank

Latest revision as of 16:46, 14 September 2024

scientific article; zbMATH DE number 7418382
Language Label Description Also known as
English
Some polynomially solvable cases of the inverse ordered 1-median problem on trees
scientific article; zbMATH DE number 7418382

    Statements

    Some polynomially solvable cases of the inverse ordered 1-median problem on trees (English)
    0 references
    0 references
    0 references
    1 November 2021
    0 references
    inverse optimization
    0 references
    location problem
    0 references
    ordered median function
    0 references
    tree
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

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