Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal algorithms for selective variants of the classical and inverse median location problems 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: 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: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm / 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: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse quickest center location problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / 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 center location problem on a tree / rank
 
Normal rank

Latest revision as of 15:22, 31 July 2024

scientific article
Language Label Description Also known as
English
Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
scientific article

    Statements

    Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 March 2023
    0 references
    0 references
    vertex quickest 1-center problem
    0 references
    tree
    0 references
    binary search
    0 references
    inverse optimization problem
    0 references
    strongly polynomial time algorithm
    0 references
    0 references