A note on the minmax regret centdian location on trees (Q935247): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: An improved algorithm for the minmax regret median problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria network location problems with sum objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: A polynomial algorithm for thep-centdian problem on a tree / rank
 
Normal rank

Latest revision as of 13:08, 28 June 2024

scientific article
Language Label Description Also known as
English
A note on the minmax regret centdian location on trees
scientific article

    Statements

    Identifiers