Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q175380
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Binay K. Bhattacharya / 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.2015.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1093958314 / 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: Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for computing minmax regret 1-median on a tree network / 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: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret k-sink Location Problem in Dynamic Path Networks / 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: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret 1-facility location on uncertain path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret 1-sink location problem in dynamic cycle networks / rank
 
Normal rank

Latest revision as of 05:33, 11 July 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
scientific article

    Statements

    Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (English)
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    facility location
    0 references
    sink location problem
    0 references
    minmax regret optimization
    0 references
    robust solution
    0 references
    uncertain demand
    0 references

    Identifiers