The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q319446
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2015.06.064 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.064 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W804266806 / 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: Inverse 1-center location problems with edge length augmentation on trees / 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 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: The complexity analysis of the inverse center location problem / 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: 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: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / 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: Location Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum multi-facility location problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2015.06.064 / rank
 
Normal rank

Latest revision as of 14:18, 9 December 2024

scientific article
Language Label Description Also known as
English
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
scientific article

    Statements

    The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    ordered median
    0 references
    inverse optimization problem
    0 references
    convex
    0 references
    tree
    0 references
    Chebyshev norm
    0 references
    Hamming distance
    0 references

    Identifiers