The multi-facility median problem with Pos/Neg weights on general graphs

DOI10.1016/j.cor.2010.08.002zbMath1201.90117OpenAlexW1988299015MaRDI QIDQ609818

Jörg Kalcsics

Publication date: 1 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.002

zbMATH Keywords

finite dominating setsnetworksmulti-facility location problemsplanar arrangements

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (4)

Unreliable point facility location problems on networks ⋮ On covering location problems on networks with edge demand ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ The multicriteria \(p\)-facility median location problem on networks

Uses Software

• CGAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The variable radius covering problem
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• Improved algorithms for several network location problems with equality measures.
• 2-medians in trees with pos/neg weights
• On the conditional \(p\)-median problem
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• The Weber Problem On The Plane With Some Negative Weights
• Obnoxious Facility Location on Graphs
• Multifacility ordered median problems on networks: A further analysis
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Efficient computation of 2-medians in a tree network with positive/negative weights

This page was built for publication: The multi-facility median problem with Pos/Neg weights on general graphs