Reverse 2-median problem on trees

https://doi.org/10.1016/j.dam.2007.04.005Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper concerns the reverse 2-median problem on trees and the reverse 1-median problem on graphs that contain exactly one cycle. It is shown that both models under investigation can be transformed to an equivalent reverse 2-median problem on a path. For this new problem an O(nlogn) algorithm is proposed, where n is the number of vertices of the path. It is also shown that there exists an integral solution if the input data are integral.

Keywords

Reverse optimization
Facility location
Median problems
Combinatorial optimization

Cited by (0)