Reverse 1-maxian problem with keeping existing 1-median

Ali Reza Sepasian ()
Additional contact information
Ali Reza Sepasian: Fasa University

OPSEARCH, 2019, vol. 56, issue 1, No 1, 13 pages

Abstract: Abstract Here we investigate the reverse 1-maxian problem when it is necessary to keep 1-median of a given network. This problem asks to modify the parameters of the network so that the 1-median does not change and the candidate place for 1-maxian improves as much as possible. For the uniform-cost model on a tree graph, an algorithm with $$O(n \log n)$$ O ( n log n ) time complexity is developed. It is also shown that the problem is solvable in linear time where it is only allowed to increase the vertex weights.

Keywords: Facility location; 1-maxian problem; Reverse optimization; Obnoxious location problem; 90C35; 90C27; 90C05 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-018-0348-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:56:y:2019:i:1:d:10.1007_s12597-018-0348-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-018-0348-7

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().