Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A linear time algorithm for inverse obnoxious center location problems on networks / 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: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5247391 / 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: Solving the absolute 1-center problem in the quickest path case / 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 quickest center location problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quickest path problem / 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 convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some inverse 1-center location problems / 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: Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 1-centre problem on trees under convex piecewise-linear cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse center location problem on a tree / rank
 
Normal rank

Latest revision as of 12:50, 26 August 2024

scientific article; zbMATH DE number 7802199
Language Label Description Also known as
English
Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
scientific article; zbMATH DE number 7802199

    Statements

    Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2024
    0 references
    center location
    0 references
    quickest 1-center problem
    0 references
    tree
    0 references
    inverse optimization
    0 references
    \(l_1\) norm
    0 references
    0 references

    Identifiers