On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830): 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-018-0632-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791184589 / 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: Optimal algorithms for inverse vertex obnoxious center location problems on graphs / 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: 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: 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 complexity analysis of the inverse center location problem / 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: 2-balanced flows and the inverse 1-median problem in the Chebyshev space / 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: Inverse 1-median problem on block graphs with variable vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-center problem on cycles with variable edge lengths / 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 convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance / 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: Location Theory / rank
 
Normal rank

Latest revision as of 06:29, 17 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
scientific article

    Statements

    On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    ordered median
    0 references
    inverse location
    0 references
    complexity
    0 references
    convex
    0 references
    tree
    0 references
    0 references
    0 references
    0 references

    Identifiers