The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6637638 / rank
 
Normal rank
Property / zbMATH Keywords
 
location problem
Property / zbMATH Keywords: location problem / rank
 
Normal rank
Property / zbMATH Keywords
 
inverse optimization
Property / zbMATH Keywords: inverse optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
1-center problem
Property / zbMATH Keywords: 1-center problem / rank
 
Normal rank
Property / zbMATH Keywords
 
tree
Property / zbMATH Keywords: tree / 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.1007/s10878-015-9907-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W360652485 / 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: 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: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Up- and downgrading the 1-center in a network / 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: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / 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: Reverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eccentric vertex problem on networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:53, 12 July 2024

scientific article
Language Label Description Also known as
English
The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
scientific article

    Statements

    The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (English)
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    location problem
    0 references
    inverse optimization
    0 references
    1-center problem
    0 references
    tree
    0 references

    Identifiers