Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 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: 5895531 / rank
 
Normal rank
Property / zbMATH Keywords
 
facility location problem
Property / zbMATH Keywords: facility location problem / rank
 
Normal rank
Property / zbMATH Keywords
 
inverse optimization
Property / zbMATH Keywords: inverse optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
absolute and vertex 1-centers
Property / zbMATH Keywords: absolute and vertex 1-centers / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SITATION / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MOD-DIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MENU-OKF / 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.dam.2011.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062885756 / 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: 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: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-maxian problem with edge length modification / 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: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse center location problem on a tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:11, 4 July 2024

scientific article
Language Label Description Also known as
English
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
scientific article

    Statements

    Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (English)
    0 references
    0 references
    0 references
    17 May 2011
    0 references
    0 references
    facility location problem
    0 references
    inverse optimization
    0 references
    combinatorial optimization
    0 references
    absolute and vertex 1-centers
    0 references
    0 references
    0 references
    0 references
    0 references