The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees / 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: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minisum facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the location of minimax facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust location problems with pos/neg weights on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 2-median problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the reverse 1‐median problem on a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-sized uncertainty and inverse problems in robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of location analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse selective obnoxious center location problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust inverse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for some inverse uncapacitated facility location problems on networks / 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the robust knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the robust shortest path problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minmax regret inverse maximum weight problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse anti-\(k\)-centrum problem on networks with variable edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret path location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Study on Reverse 1-Center Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 1-centre problem on trees under convex piecewise-linear cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some reverse location problems / rank
 
Normal rank

Revision as of 05:45, 3 August 2024

scientific article; zbMATH DE number 7752235
Language Label Description Also known as
English
The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
scientific article; zbMATH DE number 7752235

    Statements

    The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    location problem
    0 references
    reverse optimization
    0 references
    uncertainty
    0 references
    minmax regret
    0 references
    tree
    0 references
    0 references
    0 references

    Identifiers

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