Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2022.03.017 / 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.2022.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4221098277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining information in fully dynamic trees with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cores of limited length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank
 
Normal rank
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: Facility location problems with uncertainty on the plane / 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: 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: A linear time algorithm for computing minmax regret 1-median on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks / 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: 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: Q4036575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of the optimal location of a facility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations on a Graph with Probabilistic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis in Minisum Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / 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: A linear algorithm for a core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret path location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensive facility location problems on networks: an updated review / 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: Q4367277 / 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: The centdian subtree on tree networks / 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
Property / cites work
 
Property / cites work: An improved algorithm for the minmax regret path center problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the minmax regret path centdian problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minmax regret path median problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the minmax-regret 1-center and 1-median problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.03.017 / rank
 
Normal rank

Latest revision as of 05:02, 17 December 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the minmax regret path center problem with length constraint on trees
scientific article

    Statements

    Efficient algorithms for the minmax regret path center problem with length constraint on trees (English)
    0 references
    0 references
    10 May 2022
    0 references
    location theory
    0 references
    minmax regret optimization
    0 references
    centers
    0 references
    path centers
    0 references
    trees
    0 references
    0 references
    0 references
    0 references

    Identifiers