Robust location problems with pos/neg weights on a tree
From MaRDI portal
Publication:2748385
DOI10.1002/net.1029zbMath0990.90060OpenAlexW2034083313MaRDI QIDQ2748385
Helidon Dollani, Rainer E. Burkard
Publication date: 14 October 2001
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.1029
Related Items (7)
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Discrete location problems with push-pull objectives ⋮ Robust placement of sensors in dynamic water distribution systems
Cites Work
- Robust discrete optimization and its applications
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Sensitivity Analysis in Minisum Facility Location Problems
- On Parametric Medians of Trees
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Unnamed Item
- Unnamed Item
This page was built for publication: Robust location problems with pos/neg weights on a tree
