A polynomial method for the pos/neg weighted 3-median problem on a tree
From MaRDI portal
Publication:1006548
DOI10.1007/s00186-006-0121-1zbMath1156.90450OpenAlexW2059431632MaRDI QIDQ1006548
Rainer E. Burkard, Jafar Fathali
Publication date: 25 March 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0121-1
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ The connected \(p\)-median problem on block graphs ⋮ A genetic algorithm for the \(p\)-median problem with pos/neg weights ⋮ Median problems with positive and negative weights on cycles and cacti ⋮ A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights ⋮ The backup 2-median problem on block graphs ⋮ Finding a core of a tree with pos/neg weight ⋮ Inverse quickest center location problem on a tree ⋮ The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers ⋮ The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers ⋮ The \(p\)-maxian problem on block graphs ⋮ The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete location problems with push-pull objectives
- Improved complexity bounds for location problems on the real line
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- 2-medians in trees with pos/neg weights
- The \(p\)-maxian problem on a tree
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Obnoxious Facility Location on Graphs
- Computing the 2‐median on tree networks in O(n lg n) time
