Minimax regret path location on trees

DOI10.1002/net.20453zbMath1236.90137OpenAlexW2030175379WikidataQ58217188 ScholiaQ58217188MaRDI QIDQ3100694

Andrea Scozzari, Federica Ricca, Justo Puerto

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20453

zbMATH Keywords

efficient algorithmspath locationminimax regret optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)

Related Items

Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Extensive facility location problems on networks: an updated review ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Comments on: ``Extensive facility location problems on networks: an updated review ⋮ Reliability problems in multiple path-shaped facility location on networks ⋮ On the minmax regret path median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Conditional median as a robust solution concept for uncapacitated location problems
• Minmax regret location--allocation problem on a network under uncertainty
• Algorithms for central-median paths with bounded length on trees
• A note on the minmax regret centdian location on trees
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Finding the two-core of a tree
• Sorting weighted distances with applications to objective function evaluations in single facility location problems.
• Algorithms for the robust 1-center problem on a tree
• Locating tree-shaped facilities using the ordered median objective
• Facility location problems with uncertainty on the plane
• Algorithms for path medi-centers of a tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• The Minmax Relative Regret Median Problem on Networks
• Minimax Regret Single-Facility Ordered Median Location Problems on Networks
• On locating path- or tree-shaped facilities on networks
• Algorithms for a Core and k-Tree Core of a Tree
• On finding the core of a tree with a specified length
• The optimal location of a path or tree in a tree network
• A linear algorithm for a core of a tree
• The generalized P‐forest problem on a tree network
• Minimax regret p-center location on a network with demand uncertainty
• Robustness in the Pareto-solutions for the multi-criteria minisum location problem
• Introduction to Stochastic Programming
• Minmax Regret Median Location on a Network Under Uncertainty
• An improved algorithm for the minmax regret median problem on a tree
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
• Conditional location of path and tree shaped facilities on trees
• The bi‐criteria doubly weighted center‐median path problem on a tree

This page was built for publication: Minimax regret path location on trees