Minimax regret path location on trees (Q3100694): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Justo Puerto / rank
Normal rank
 
Property / author
 
Property / author: Justo Puerto / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58217188 / 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.1002/net.20453 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030175379 / 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 path medi-centers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret Median Location on a Network Under 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: The Minmax Relative Regret Median Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location problems with uncertainty on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for central-median paths with bounded length on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the two-core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for the path/tree-shaped facility location problems in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / 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: Robustness in the Pareto-solutions for the multi-criteria minisum location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the core of a tree with a specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for a core of a tree / 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: Efficient Algorithms for Finding a Core of a Tree with a Specified Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / 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: The bi‐criteria doubly weighted center‐median path problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating tree-shaped facilities using the ordered median objective / 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: Sorting weighted distances with applications to objective function evaluations in single facility location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized <i>P</i>‐forest problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional location of path and tree shaped facilities on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Minimax regret path location on trees
scientific article

    Statements

    Minimax regret path location on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2011
    0 references
    path location
    0 references
    minimax regret optimization
    0 references
    efficient algorithms
    0 references
    0 references
    0 references

    Identifiers