Minimax regret 1-sink location problem in dynamic path networks (Q2348257): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Naoki Katoh / rank
 
Normal rank
Property / author
 
Property / author: Yin-Feng Xu / 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.tcs.2014.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066560026 / 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: A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree / 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: Minimax Regret 1-Sink Location Problems in Dynamic Path Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret location--allocation problem on a network under uncertainty / 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: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional median as a robust solution concept for uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Single-Facility Ordered Median Location Problems on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret 1-Facility Location on Uncertain Path Networks / rank
 
Normal rank

Latest revision as of 05:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Minimax regret 1-sink location problem in dynamic path networks
scientific article

    Statements

    Minimax regret 1-sink location problem in dynamic path networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2015
    0 references
    minimax regret
    0 references
    sink location
    0 references
    dynamic flow
    0 references
    evacuation planning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references