Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of robust single facility location problems on networks with uncertain edge lengths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret p-center location on a network with demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the robust 1-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for center problems in cactus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the robust 1-center problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax-regret robust 1-median location on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minmax regret centdian location on trees / 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: Location science research: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-Line Maintenance of Planar Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret path location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the minmax-regret 1-center and 1-median problems / rank
 
Normal rank

Latest revision as of 18:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
scientific article

    Statements

    Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2015
    0 references
    facility location
    0 references
    1-center problem
    0 references
    minmax regret optimization
    0 references
    robust solution
    0 references
    uncertain weight
    0 references
    0 references

    Identifiers