Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks

Behrooz Alizadeh (), Esmaeil Afrashteh () and Fahimeh Baroughi ()
Additional contact information
Behrooz Alizadeh: Sahand University of Technology
Esmaeil Afrashteh: Sahand University of Technology
Fahimeh Baroughi: Sahand University of Technology

Journal of Optimization Theory and Applications, 2018, vol. 178, issue 3, No 10, 914-934

Abstract: Abstract This paper concerns with some variants of the inverse obnoxious median location problem on tree networks, where the aim is either to augment or to reduce the edge lengths at the minimum total cost such that a prespecified subset of vertices becomes an obnoxious multi-facility median location with respect to the perturbed edge lengths. For both augmentation and reduction models, under the rectilinear norm and the sum-type Hamming distance, we develop novel combinatorial algorithms with polynomial time complexities. Particularly, if the underlying tree is an extended star graph, then the problems can be solved in linear time.

Keywords: Obnoxious median location; Combinatorial optimization; Inverse optimization; Time complexity; 90B80; 90B85; 90C27 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-018-1334-1 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:joptap:v:178:y:2018:i:3:d:10.1007_s10957-018-1334-1

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-018-1334-1

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().